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 Regular Languages in theory of automata

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

PDA for ending with a:

Accepted Strings: a, ba, aba, aaa, bba, abba,……etc.

Rejected Strings: b, ba, abb,…….etc.


  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.