The transitions of a pushdown automata accepting L are given below:
δ(q0,a,z0) = (q1,az0)
δ(q1,a,a) = (q1,aa)
δ(q1,b,a) = (q2, ϵ)
δ(q2,b,a) = (q2, ϵ)
δ(q2, ϵ,z0) = (q2, ϵ)
δ(q0, ϵ,z0) = (q0, ϵ)
Find the language L that the above PDA accepts by empty stack where z0 is the start symbol.1
Language which accepts all strings having equal number of a’s and b’s
2
Language which accepts all strings in the form of anbn, n ≥ 0
3
Language which accepts all strings in the form of bnan, n ≥ 0
4
Language which accepts all strings with even number of a’s and b’s
5
Question Not Attempted