Turing Machine

Home > Languages > Formal Language > Pushdown Automata > Turing Machine

It is not technically a PDA, but it is possible to simulate a PDA using a Turing Machine. A Turing Machine can recognize any recursively enumerable language, which makes it more powerful than any PDA.