Pushdown Automata, Context Free Grammars and Languages
Part of the Studies in Linguistics and Philosophy book series (SLAP, volume 30)
We turn next to a class of automata which are more powerful than the finite automata in the sense that they accept a larger class of languages. These are the pushdown automata (pda’s).
KeywordsRegular Language Finite Automaton Parse Tree Context Free Grammar Context Free Language
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Kluwer Academic Publishers 1993