Abstract
Deep pushdown automata, explored in this chapter, represent language-accepting models based upon new stack structures, which can be modified deeper than on their top. As a result, these automata can make expansions deeper in their pushdown lists while ordinary pushdown automata (see Sect. 2.4) can expand only the very pushdown top.
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
Bibliography
A.V. Aho, J.D. Ullman, The Theory of Parsing, Translation and Compiling, Volume I: Parsing (Prentice-Hall, New Jersey, 1972)
M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Boston, 1978)
H.R. Lewis, C.H. Papadimitriou, Elements of the Theory of Computation (Prentice-Hall, New Jersey, 1981)
A. Meduna, Automata and Languages: Theory and Applications (Springer, London, 2000)
G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1: Word, Language, Grammar (Springer, New York, 1997)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Meduna, A., Soukup, O. (2017). Deep Pushdown Automata and New Stack Structures. In: Modern Language Models and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-63100-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-63100-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63099-1
Online ISBN: 978-3-319-63100-4
eBook Packages: Computer ScienceComputer Science (R0)