PDA for a,bnanbm in theory of automata

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 .

By: Prof. Fazal Rehman Shamil    CEO @ T4Tutorials
Whatsapp: +92 302 87 000 85     Facebook: For Discussions

Leave a Reply

Your email address will not be published. Required fields are marked *