Deep Pushdown Automata and New Stack Structures

  • Alexander Meduna
  • Ondřej Soukup


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.


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

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Alexander Meduna
    • 1
  • Ondřej Soukup
    • 2
  1. 1.Department of Computer ScienceBrno University of TechnologyBrnoCzech Republic
  2. 2.Department of Information TechnologyBrno University of TechnologyBrnoCzech Republic

Personalised recommendations