Abstract
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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Kluwer Academic Publishers
About this chapter
Cite this chapter
Partee, B.H., Ter Meulen, A., Wall, R.E. (1993). Pushdown Automata, Context Free Grammars and Languages. In: Mathematical Methods in Linguistics. Studies in Linguistics and Philosophy, vol 30. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2213-6_18
Download citation
DOI: https://doi.org/10.1007/978-94-009-2213-6_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-277-2245-4
Online ISBN: 978-94-009-2213-6
eBook Packages: Springer Book Archive