PDA for the language of anbnc2n in theory of automata

PDA for the language of anbnc2n in theory of automata

Accepted strings

Following strings must be accepted by PDA;

abcc, aabbcccc, aaabbbcccccc,…..etc.

Rejected strings

Following strings must be rejected by PDA;

abc, abccc, aabbcc, …….etc.

PDA examples

  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 *