engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider the following context free grammar
A → aAa | bA | ϵ
given grammar:
1
Generates all the strings with even number of a’s
2
Generates all strings with odd number of b’s
3
Generates set of all strings with number of b’s equal to half the number of a’s.
4
None of the above