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

 

Prof.Fazal Rehman Shamil (Available for Professional Discussions)
1. Message on Facebook page for discussions,
2. Video lectures on Youtube
3. Email is only for Advertisement/business enquiries.