Give the state transitions for a pda with only 2 states, for the language "a^n b^2n", where n >=1 .
Following notations are used in the solution.
* (StartState, SymbolRead) --> (ActionList, FinalState)
FinalState is arrived at after executing the ActionList.
* E = Null Symbol (Epsilon, Indicating end of input)
* REJECT and ...
Solution comments pda transitions for better understanding of it, and serves as a guidance.