engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider grammar G with productions A → a | Aa | bAA | AAb | AbA
Choose a false statement :
1
aaabb is in L(G)
2
abb is in L(G)
3
A is start symbol of G
4
aaaabb is in L(G)