Pushdown automata (PDA)

Home > Languages > Formal Language > Context-Free Grammars > Pushdown automata (PDA)

A type of automaton that can recognize context-free languages by using a stack to keep track of the derivation.