in Theory of Computation
233 views
0 votes
0 votes
Find a context-free grammar that generates the language accepted by the npda $M =$ ({$q_0,q_1$}, {$a,b$}, {$A, z$}$,δ, q_0, z,$ {$q_1$}), with transitions
                            $δ(q_0, a,z) =$ {$(q_0, Az)$},
                            $δ (q_0,b, A) =$ {$(q_0, AA)$},
                            $δ(q_0, a, A) =$ {$(q_1,λ)$}.
in Theory of Computation
233 views

Please log in or register to answer this question.

Related questions