Prerequisite – Pushdown automata, Pushdown automata acceptance by final state

**Problem –** Design a non deterministic PDA for accepting the language L = { : i==k or j==l, i>=1, j>=1}, i.e.,

L = {abcd, aabccd, aaabcccd, abbcdd, aabbccdd, aabbbccddd, ......}

In each string, the number of a’s are followed by any number of b’s and b’s are followed by the number of c’s equal to the number of a’s and c’s are followed by number of d’s equal number of b’s.

**Explanation –**

Here, we need to maintain the order of a’s, b’s, c’s and d’s.That is, all the a’s are coming first then all the b’s are coming and then all the c’s are coming then all the d’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, b, c, d, z }

Where,

= set of all the stack alphabet

z = stack start symbol

**Approach used in the construction of PDA –**

In designing a NPDA, for every a’, ‘b’, ‘c’ and ‘d’ will comes in proper order.

- For i==k : Whenever ‘a’ comes, push it in stack and if ‘a’ comes again then also push it in the stack.After that, if ‘b’ comes not do any operation. After that, when ‘c’ comes then pop ‘a’ from the stack each time.After that, if ‘d’ comes not do any operation.
- For j==l : Whenever ‘a’ comes, not do any operation.After that, if ‘b’ comes push it in stack and if ‘b’ comes again then also push it in the stack. After that, when ‘c’ comes not do any operation.After that, if ‘d’ comes then pop ‘b’ from the stack each time.

So that the stack becomes empty.If stack is empty then we can say that the string is accepted by the PDA.

**Stack transition functions –**

(q0, a, z) (q1, az) (q0, a, z) (q3, z) (q1, a, a) (q1, aa) (q1, b, a) (q1, a) (q1, c, a) (q2, ) (q2, c, a) (q2, ) (q2, d, ) (q2, ) (q2, , z) (qf1, z) (q3 a, z) (q3, z) (q3 b, z) (q3, bz) (q3 b, b) (q3, bb) (q3 c, b) (q3, b) (q3, d, b) (q4, ) (q4, d, b) (q4, ) (q4, , z) (qf2, z)

Where, q0 = Initial state

qf1, qf2 = Final state

= indicates pop operation

So, this is our required non deterministic PDA for accepting the language L ={ : i==k or j==l, i>=1, j>=1}.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- NPDA for accepting the language L = {a
^{n}b^{n}| n>=1} - NPDA for accepting the language L = {a
^{2m}b^{3m}| m ≥ 1} - NPDA for accepting the language L = {a
^{m}b^{(2m+1)}| m ≥ 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
^{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^{(m+n)}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 = {a
^{m}b^{n}c^{(m+n)}| m,n ≥ 1} - NPDA for accepting the language L = {a
^{n}b^{m}c^{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
^{n}b^{(2n)}| n>=1} U {a^{n}b^{n}| 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} - NFA machines accepting all strings that ends or not ends with substring 'ab'
- DFA machines accepting odd number of 0’s or/and even number of 1’s

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.