Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the production rules of grammer G:
S → AbB
A → aAb ∣ λ
B → bB ∣ λ
Which of the following language L is generated by grammer G?
1
L = {anbm ∶ n ≥ 0, m > n}
2
L = {anbm ∶ n ≥ 0, m ≥ 0}
3
L = {anbm ∶ n ≥ m}
4
L = {anbm ∶ n ≥ m, m > 0}