GATE | GATE CS 1996 | Question 61

Let Q = ( {q1,q2}, {a,b}, {a,b,Z}, δ, Z, ϕ) be a pushdown automaton accepting by empty stack for the language which is the set of all non empty even palindromes over the set {a,b}. Below is an incomplete specification of the transitions δ. Complete the specification. The top of the stack is assumed to be at the right end of the string representing stack contents.

δ(q1, a, Z)={(q1, Za)}
δ(q1, b, Z)={(q1, Zb)}
δ(q1, a, a)={(..... , .....)}
δ(q1, b, b)={(..... , .....)}
δ(q2, a, a)={(q2, ϵ)}
δ(q2, b, b)={(q2, ϵ)}
δ(q2, ϵ, Z)={(q2, ϵ)}


Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.