Abstract
In Chap. 3 we studied finite automata, which have a finite amount of memory. In this chapter we introduce a new type of computational model called a pushdown automaton, which can be obtained by giving a nondeterministic finite automaton a memory component called a stack. The stack memorizes an arbitrarily long string, but has the restriction that a symbol must be read and written at one end of the string. It will be shown that a pushdown automaton and a context-free grammar are equivalent in power to specify languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Maruoka, A. (2011). Pushdown Automata. In: Concise Guide to Computation Theory. Springer, London. https://doi.org/10.1007/978-0-85729-535-4_5
Download citation
DOI: https://doi.org/10.1007/978-0-85729-535-4_5
Publisher Name: Springer, London
Print ISBN: 978-0-85729-534-7
Online ISBN: 978-0-85729-535-4
eBook Packages: Computer ScienceComputer Science (R0)