- Related Questions & Answers
- Construct Deterministic PDA for a^n b^n where n>=1
- Construct a ∈-NFA for the language L = (a* + b*)
- Construct a TM that accepts even-length palindromes over the alphabet {0,1}?
- Construct a PDA for language L = {0n 1m2m3n | n>=1, m>=1}
- Design a PDA which recognizes the language
- Construct ∈-NFA of Regular Language L = b + ba*
- Construct a Finite Automata for the regular expression ((a+b)(a+b))*.
- Python a += b is not always a = a + b
- Print a closest string that does not contain adjacent duplicates in C++
- Construct DFA beginning with ‘a’ but does not have substring ‘aab’
- MySQL query to get a field value that does not contain empty spaces?
- Design a DFA that accepts at most 3 a"s
- How to extract elements of a list that do not contain NULL in R?
- C Program to construct a DFA which accepts L = {aN | N ≥ 1}
- Give the examples of a context free language that are not regular?

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Push down Automata (PDA) is complement of the PDA that contain Substring bbb

**Steps**

Make the PDA for accepting those strings that have conation bbb.

Complement it by making non-accepting as accepting and vice versa.

**Construct PDA**

You can construct the PDA as shown below for the **(a,b)* language**

The nature of transition format is Input, Top of stack, PUSH/POP

**Example**

a ,a , aa means on i/p a and top of stack is a then push a

At q0 i,e initial if a or b anything came move state to q1

Till q1 we get 1 b to make substring b_ _ so now on q1 if a comes, then it will disturb the pattern of bbb. So make a move to q0, as shown in PDA above.

But on getting b, b, bb that means i/p is b and Top of stack is b. Push bb and now the pattern is bb_ and move to state q2.

Now at q2, we get 2 bb to make substring bb_. So now, if at q2 a comes, then it will disturb the pattern of bbb. So make a move to q0, as shown in PDA above.

But on getting b, b, bb that means i/p is b and Top of stack is b. Push bb and now the pattern is bbb and move to state q4.

At state q4 now, we have completed the substring bbb. So now, a or b any symbol is accepted.

When the whole string is ended and state is q4, we move to state q5.

Now, if we want the language that accepts the string having bbb as a substring, then q5 is the final state.

- But our question is we don't want bbb. So all the other states are final states, that is q0,q1,q2,q4 all are final states.
So, the PDA is completed.

Advertisements