PDA for the language of anbnc2n in theory of automata

By: Prof. Dr. Fazal Rehman | Last updated: July 24, 2022

PDA for the language of aⁿbⁿc²ⁿ in the 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.

Note: Single stack PDA is not possible for this language.