Propositional-Logic

2014 December UGC NET Paper 1

Propositional-Logic

2014 December UGC NET Paper 1

UPPCL AE 2022

Question 6

Let Grammar G(V=(5).T (ab)SP)stere V is a no-empty set of variables or non-terminals. T is a set of terminals. S is a start symbol. λ is a null string and is a set of production rules. If n_a (w), (w) n_b represents the number of a’s and b’a in string w, then the language derived from set of production rules

A	{W ∈ {a,b}^* : n_a (w) = n_b(w)}
B	{W ∈ {a, b}^* : n_a (w) # n_b (w)}
C	{W ∈ {a, b}^* : n_a (w) < n_b(w)}
D	{W ∈ {a, b}^* : n_a (w) > n_b(w)}

Correct Answer: A

0 0 votes

Article Rating

Subscribe

0 Comments

Inline Feedbacks

View all comments

0

Would love your thoughts, please comment.x

()

error: Alert: Content selection is disabled!!