[Overview] [Previous] [Next]

Deterministic Pushdown Automata

A nondeterministic finite acceptor differs from a deterministic finite acceptor in two ways: A nondeterministic pushdown automaton differs from a deterministic pushdown automaton (dpda) in almost the same ways: A deterministic context-free language is a language that can be recognized by a dpda.

The deterministic context-free languages are a proper subset of the context-free languages.


Copyright 1996 by David Matuszek
Last modified Mar 18, 1996