NPDA for accepting the language L = {anbm | n,m ≥ 1 and n ≠ m}

Prerequisite – Pushdown automata, Pushdown automata acceptance by final state

Problem – Design a non deterministic PDA for accepting the language , i.e.,

L = {aab, abb, aaab, abbb, aaaab, aaabb, aabbb, abbbb ......}

In each of the string, the number of a’s are followed by unequal number of b’s.

Explanation –
Here, we need to maintain the order of a’s and b’s. That is, all the a’s are are coming first and then all the b’s are coming. Thus, we need a stack along with the state diagram. The count of a’s and b’s is maintained by the stack. We will take 2 stack alphabets:

 = { a, z }

Where,

= set of all the stack alphabet
z = stack start symbol

Approach used in the construction of PDA –
As we want to design a NPDA, thus every time ‘a’ comes before ‘b’. When ‘a’ comes then push it in stack and if again ‘a’ comes then also push it. After that, when ‘b’ comes then pop one ‘a’ from the stack each time. So, at the end if the stack becomes empty and b is coming or string is end and stack is not empty then we can say that the string is accepted by the PDA.

Stack transition functions –

(q0, a, z)  (q0, az)
(q0, a, a)  (q0, aa)
(q0, b, a)  (q1,  )
(q1, b, a)  (q1,  )
(q1, , a)  (qf, a)
(q1, b, z)  (qf, z)


Where, q0 = Initial state
qf = Final state
= indicates pop operation

State Transition Diagram –

So, this is our required non deterministic PDA for accepting the language .

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :

Be the First to upvote.

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