Recent questions tagged pushdown-automata

1 votes
0 answers
4
Design the Push down Automata for the language L={anbmc2nd3m,n,m>=1}.Check the acceptance string by both the empty stack and final state method.
0 votes
1 answer
6
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
0 votes
1 answer
8
1 votes
1 answer
16
Please explain with simplified diagram the transition in the pda. Ans (d)
1 votes
2 answers
18
2 votes
2 answers
20
Which machine is equally powerful in both deterministic and non-deterministic form?Push Down AutomataTuring machineLinear Bounded AutomataNone of the options