Oops! It appears that you have disabled your Javascript. In order for you to see this page as it is meant to appear, we ask that you please re-enable your Javascript!

PDA for a,bnanbm in theory of automata

Last modified on May 27th, 2018 at 9:17 pm

PDA for ambnanbm in theory of automata

In this PDA, first a and last b must be equal. Similarly, second b and third a must be equal. 

Accepted strings

Following strings must be accepted by PDA;

abab, abbaab, aababb,…..etc.

Rejected strings

Following strings must be rejected by PDA;

ababb, aabab, abaab, …….etc.

PDA solution

  List of All examples of Push Down Automata (PDA): Click Here .

Prof. Fazal Rehman Shamil
Researcher, Publisher of International Journal Of Software Technology & Science ISSN: 2616-5325
Instructor, SEO Expert, Web Programmer and poet.
Feel free to contact.