Skip to main content
SpringerLink
Log in

Pushdown Automata

  • Chapter
Formal Languages and Applications

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 148))

Abstract

Recursive functions in a computer program can be modelled by suitable grammatical rules. As an example, cf. Figure 6.1, the recursive function Hanoi, moving n disks from pin s to pin t using additional pin v can be represented by productions like H stv (n) → H svt (n−1) m st H vts (n−1) and H stv (0) → λ—with terminal symbols m xy , x,y ∈ {s,t,v}. Of course, context-free grammars do not have attributes to their nonterminals and we could abstract from them by writing H stv → H svt m st H vts , H stv → λ.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.-M. Autebert, J. Berstel, L. Boasson. Context-Free Languages and Pushdown Automata. In: Handbook of Formal Languages, Vol. 1 ( G. Rozenberg, A. Salomaa, eds.) Springer, Berlin, 1997.

    Google Scholar 

  2. J. Berstel. Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart, 1979.

    MATH  Google Scholar 

  3. J. Berstel, L. Boasson. Context-Free Languages. In: Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics ( J. van Leeuwen, ed.) Elsevier, Amsterdam, 1990.

    Google Scholar 

  4. J.R. Büchi. Regular Canonical Systems. Arch. Math. Logik Grundlagenforschung, 6 (1964) 91–111.

    Article  MATH  Google Scholar 

  5. N. Chomsky. Context Free Grammars and Pushdown Storage. Quarterly Progress Report, Vol. 65, MIT Research Laboratory in Electronics, Cambridge, MA, 1962.

    Google Scholar 

  6. E. Csuhaj-Varjú, V. Mitrana, G. Vaszil. Distributed Pushdown Automata Systems: Computational Power. In: [10], pages 218–229.

    Google Scholar 

  7. J. Engelfriet. Iterated Stack Automata. Information and Computation, 95 (1991) 21–75.

    Article  MathSciNet  Google Scholar 

  8. J. Engelfriet, H. Vogler. Look-Ahead on Pushdowns. Information and Computation, 73 (1987) 245–279.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Engelfriet, H. Vogler. Pushdown Machines for the Macro Tree Transducer. Theoretical Computer Science, 42 (1986) 251–368.

    Article  MathSciNet  MATH  Google Scholar 

  10. Z. Ésik, Z. Fülöp (Eds.). Developments in Language Theory, 7th International Conference, DLT 2003, Proceedings. Lecture Notes in Computer Science, Vol. 2710, Springer 2003.

    Google Scholar 

  11. J. Evey. Application of Pushdown Store Machines. Proceedings of the 1963 Fall Joint Computer Conference, Montreal, AFIPS Press, 1963.

    Google Scholar 

  12. S. Greibach. A Note on Pushdown Store Automata and Regular Systems. Proceedings of the American Mathematical Society, 18 (1967) 263–268.

    Article  MathSciNet  MATH  Google Scholar 

  13. S. Greibach. Remarks on Blind and Partially Blind One-way Multicounter Machines. Theoretical Computer Science, 7 (1978) 311–324.

    Article  MathSciNet  MATH  Google Scholar 

  14. S. Ginsburg. Algebraic and Automata-theoretic Properties of Formal Languages. Fundamental Studies in Computer Science, Vol. 2, North-Holland, 1975.

    Google Scholar 

  15. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.

    MATH  Google Scholar 

  16. M. Holzer, M. Kutrib. Flip-Pushdown Automata: Nondeterminism is Better than Determinism. In: [10], pages 361–372.

    Google Scholar 

  17. H.J. Hoogeboom. Context-Free Valence Grammars - Revisited. In: Developments in Language Theory, DLT 2001 (W. Kuich, G. Rozenberg, A. Salomaa, eds. ), Lecture Notes in Computer Science, Salomaa, eds. ), 2295, 293–303, 2002.

    Google Scholar 

  18. J. Hoperoft, J. Ullman. Formal Languages and their Relation to Automata. Addison-Wessley, Reading, Mass., 1969.

    Google Scholar 

  19. J. Hoperoft, J. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.

    Google Scholar 

  20. D.E. Knuth. On the Translation of Languages from Left to Right. Information and Control, 8 (1965) 607–639.

    Article  MathSciNet  Google Scholar 

  21. D.E. Knuth, J.H. Morris, V.R. Pratt. Fast Pattern Matching in Strings SIAM Journal on Computing, 6 (1977) 323–360.

    MathSciNet  MATH  Google Scholar 

  22. R.E. Ladner, R.J. Lipton, L.J. Stockmeyer. Alternating Pushdown and Stack Automata. SIAM Journal on Computing 13 (1984) 135–155.

    Article  MathSciNet  MATH  Google Scholar 

  23. A.G. Oettinger. Automatic Syntactic Analysis and the Pushdown Store. Proceedings of Symposia on Applied Mathematics, Vol. 12, Providence, RI, American Mathematical Society, 1961.

    Google Scholar 

  24. F. Otto. Restarting Automata and Their Relations to the Chomsky Hierarchy. In: [10], pages 55–74.

    Google Scholar 

  25. M. Schützenberger. On Context Free Languages and Pushdown Automata. Information and Control, 6 (1963) 246–264.

    Article  MathSciNet  MATH  Google Scholar 

  26. G. Sénizergues. L(A) = L(B)? A Simplified Decidability Proof. Theoretical Computer Science, 281 (2002) 555–608.

    Article  MathSciNet  MATH  Google Scholar 

  27. K. Wagner, G. Wechsung. Computational Complexity. Reidel, Dordrecht, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333 CA, Leiden, the Netherlands

    Hendrik Jan Hoogeboom & Joost Engelfriet

Authors
  1. Hendrik Jan Hoogeboom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Lingustics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  3. Institute of Mathematics, Romanian Academy, PO Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hoogeboom, H.J., Engelfriet, J. (2004). Pushdown Automata. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39886-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53554-3

  • Online ISBN: 978-3-540-39886-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation