Two stacks push down automata (PDA) includes the following factors −
A Turing machine can accept languages that are not accepted by any PDA with one stack.
The strength of pushdown automata is increased by adding extra stacks.
A PDA with two stacks has the same computation power as for a Turing Machine.
Two-Stack PDA is a computational model which is based on the generalization of Pushdown Automata (PDA) and Non-deterministic Two-Stack PDA which is equivalent to a deterministic Two-Stack PDA.
The moves of the Two-Stack PDA are based on the following −
The state of finite control.
The input symbol that reads.
The top of the stack symbol on each of its stacks.
Some of the characteristics of the Turing Machine (TM) and the Two-stack Push down automaton (Two-stack PDA) Machine are as follows −
|Turing Machine||Two-stack PDA Machine|
|Change state.||Change state.|
|Write a tape symbol in cell scanned.||The input symbol read.|
|Move the head left or right.||Replace the symbol of each stack with a string of zero or more stack symbols.|
The diagram given below is of the TM variant Two-stack PDA machine.
The right half of the tape is kept on one stack, and the left half on the other.
As we move along, we pop characters off one and push them onto the other.