Deep Pushdown Automata and New Stack Structures
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.
- [AU72]A.V. Aho, J.D. Ullman, The Theory of Parsing, Translation and Compiling, Volume I: Parsing (Prentice-Hall, New Jersey, 1972)Google Scholar
- [Har78]M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Boston, 1978)Google Scholar
- [LP81]H.R. Lewis, C.H. Papadimitriou, Elements of the Theory of Computation (Prentice-Hall, New Jersey, 1981)Google Scholar
- [Med00a]A. Meduna, Automata and Languages: Theory and Applications (Springer, London, 2000)Google Scholar
- [RS97a]G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1: Word, Language, Grammar (Springer, New York, 1997)Google Scholar