Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Regular Languages and Finite Automata
Which of the followings is a regular grammar?
1
S → abA, A → baB, B → aA, B → bb
2
S → abB, A → aaBb, B → bbAa, A → λ
3
S → aSb, S → SS, S → λ
4
S → aSa, S → bSb, S → λ
5
Question Not Attempted