# Construct Pushdown automata for L = {0^{n}1^{m}2^{(n+m)} | m,n ≥ 0}

Prerequisite – Pushdown automata, NPDA for accepting the language L = {a^{m}b^{n}c^{(m+n)} | m,n ≥ 1}

PDA plays a very important role in task of compiler designing. That is why there is a need to have a good practice on PDA. Our objective is to construct a PDA which accepts a string of the form {(0^n)(1^m)(2^(n+m))}

**Example-**

Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in **GATE Test Series Course**.

Learn all **GATE CS concepts with Free Live Classes** on our youtube channel.

Input: 00001112222222 Output: Accepted Input: 00011112222 Output: Not Accepted

**Approach used in this PDA –**

There can be four cases while processing the given input string.

**Case 1- m=0:** In this cases the input string will be of the form {0^{n}2^{n}}. In this condition, keep on pushing 0’s in the stack until we encounter with 2. On receiving 2 check if top of stack is 0, then pop it from the stack. Keep on popping 0’s until all the 2’s of the string are processed. If we reach to the end of input string and stack becomes empty, then reached to the final state i.e. Accepts the input string else move to dead state.

**Case 2- n=0:** In this cases the input string will be of the form {1^{m}2^{m}}. In this condition, keep on pushing 1’s in the stack until we encounter with 2. On receiving 2 check if top of stack is 1, then pop it from the stack. Keep on popping 1’s until all the 2’s of the string are processed. If we reach to the end of input string and stack becomes empty, then reached to the final state i.e. Accepts the input string else move to dead state.

**Case 3- m, n>0:** In this cases the input string will be of the form {0^{n}1^{m}2^{(n+m)}}. In this condition, keep on pushing 0’s and 1’s in the stack until we encounter with 2. On receiving 2 check if top of stack is 1 or 0, then pop it (1 or 0) from the stack. Keep on poping 1’s or 0’s until all the 2’s of the input string are processed. If we reach to the end of input string and stack becomes empty, then reach to final state i.e. accept the input string else move to dead state.

**Case 4- m=0, n=0:** In this case the input string will be empty. Therefore directly jump to final state.