Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
Consider the following transition function:
\(δ(q_0,a,Z_0)=(q_0,aZ_0)\)
\(δ(q_0,a,a)=(q_0,aa)\)
\(δ(q_0,b,a)=(q_1,ϵ)\)
\(δ(q_1,b,a)=(q_1,ϵ)\)
\(δ(q_1,c,a)=(q_2,ϵ)\)
\(δ(q_2,c,a)=(q_2,ϵ)\)
\(δ(q_2,ϵ,Z_0)=(q_3,Z_0)\)
What is the language generated by the above push down automata?
1
\(a^{m}b^mc^n /m,n>=1\)
2
\(a^{n}b^mc^{2n} /m,n>=1\)
3
\(a^{m+n}b^mc^n /m,n>=1\)
4
\(a^{2m}b^mc^n /m,n>=1\)
5
Question Not Attempted