Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the following grammar:
S → 0A|0BB
A → 00A|λ
B → 1B|11C
C → B
Which language does this grammar generate?
1
L((00) * 0 + (11) * 1)
2
L(0(11) * + 1(00) * )
3
L((00) * 0)
4
L(0(11) * 1)