Linked from

The 12 pages that link to Pushdown automaton, each with the reason it gives.

• Turing machineCompared with: Its stack memory lies between finite-state storage and a Turing machine’s tape.

• Formal languageRelated: Its stack lets it recognize languages beyond finite-state machines, such as balanced parentheses.

• Finite-state machineCompared with: Its stack lets it recognize some languages that finite-state machines cannot.

• Context-free grammarRelated: Pushdown automata recognize exactly the languages generated by context-free grammars.

• Regular languageCompared with: Its stack recognizes some languages, such as balanced parentheses, that are not regular.

• Finite automatonCompared with: Its unbounded stack can track nested structure beyond finite automata's memory.

• Chomsky hierarchyCompared with: Its stack gives context-free languages more power than finite-state recognition.

• Context-free languageRelated: Pushdown automata recognize exactly the context-free languages.

• Automata theoryBroader topic: A stack lets an automaton recognize languages beyond the regular class.

• State machineCompared with: A stack lets it recognize nested structures that finite state alone cannot.

• Ogden's lemmaRelated: Its stack behavior provides an automata-theoretic view of the dependencies behind the lemma.

• Model of computationCompared with: Its stack provides more memory than a finite automaton but less than a Turing machine tape.