PDA for the language of anbnc2n in theory of automata
Last modified on May 27th, 2018 at 9:10 pm
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.
List of All examples of Push Down Automata (PDA): Click Here .