0 votes
123 views

Consider a push down automata (PDA) below which runs over the input alphabet (a, b). It has the stack alphabet {z0, X}, where z0  is the bottom of stack marker. The set of states of PDA is {q0,q1} where q0 is the start state and rules of the PDA are,  (The languare accepted by the grammar is)

reshown | 123 views
0
OPTION D, I think.
0
i am getting

L = { $(b^{n}.a.b^{n}.a)^{m} \;| \; m\geqslant 0, \; n> 0$ }
0
Yes..i am getting it too

+1 vote
1 answer
1
0 votes
3 answers
2
0 votes
0 answers
3