Propositional-Logic
August 4, 20242014 December UGC NET Paper 1
August 4, 2024UPPCL 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 na (w), (w) nb represents the number of a’s and b’a in string w, then the language derived from set of production rules
| {W ∈ {a,b}* : na (w) = nb(w)} | |
| {W ∈ {a, b}* : na (w) # nb (w)} | |
| {W ∈ {a, b}* : na (w) < nb(w)} | |
| {W ∈ {a, b}* : na (w) > nb(w)} |
Correct Answer: A