Prerequisite – Pushdown automata, Pushdown automata acceptance by final state

**Problem –** Design a non deterministic PDA for accepting the language L = { | n>=1}, i.e.,

L = {ab, aabb, aaabbb, aaaabbbb, ......}

In each of the string, the number of a’s are followed by equal 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 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, , z) (qf, z)

Where, q0 = Initial state

qf = Final state

= indicates pop operation

So, this is our required non deterministic PDA for accepting the language L = { : n>=1}.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

## Recommended Posts:

- NPDA for accepting the language L = {a
^{n}b^{m}c^{n}| m,n>=1} - NPDA for accepting the language L = {a
^{2m}b^{3m}| m ≥ 1} - NPDA for accepting the language L = {a
^{m}b^{n}c^{(m+n)}| m,n ≥ 1} - NPDA for accepting the language L = {a
^{n}b^{n}c^{m}| m,n>=1} - NPDA for accepting the language L = {a
^{m}b^{(2m)}| m>=1} - NPDA for accepting the language L = {a
^{m}b^{n}c^{p}d^{q}| m+n=p+q ; m,n,p,q>=1} - NPDA for accepting the language L = {a
^{m}b^{(m+n)}c^{n}| m,n ≥ 1} - NPDA for accepting the language L = {a
^{m}b^{(2m+1)}| m ≥ 1} - NPDA for accepting the language L = {a
^{i}b^{j}c^{k}d^{l}| i==k or j==l,i>=1,j>=1} - NPDA for accepting the language L = {a
^{n}b^{(2n)}| n>=1} U {a^{n}b^{n}| n>=1} - NPDA for accepting the language L = {a
^{n}b^{m}| n,m ≥ 1 and n ≠ m} - NPDA for accepting the language L = {a
^{(m+n)}b^{m}c^{n}| m,n ≥ 1} - NPDA for accepting the language L = {a
^{m}b^{n}c^{n}| m,n ≥ 1} - NPDA for accepting the language L = {wwR | w ∈ (a,b)*}
- NPDA for the language L ={w∈ {a,b}*| w contains equal no. of a's and b's}
- DFA for accepting the language L = { a
^{n}b^{m}| n+m=even } - DFA for accepting the language L = {a
^{n}b^{m}| n+m=odd} - NPDA for L = {0
^{i}1^{j}2^{k}| i==j or j==k ; i , j , k >= 1} - DFA machines accepting odd number of 0’s or/and even number of 1’s
- NFA machines accepting all strings that ends or not ends with substring 'ab'

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.