PDA for ambnanbm in theory of automata
In this PDA, first a and last b must be equal. Similarly, second b and third a must be equal.
Following strings must be accepted by PDA;
abab, abbaab, aababb,…..etc.
Following strings must be rejected by PDA;
ababb, aabab, abaab, …….etc.