Skip to main content
SpringerLink
Log in

Algebra, Automata, and Computation

  • Chapter
  • First Online:
Modern Language Models and Computation

  • 673 Accesses

Abstract

Traditionally, from an algebraic viewpoint, automata work over free monoids. The present chapter, however, modifies this standard approach so they work over other algebraic structures. More specifically, this chapter discusses a modification of pushdown automata that is based on two-sided pushdowns into which symbols are pushed from both ends.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

Bibliography

  1. J. Autebert, J. Berstel, L. Boasson, (eds.), Context-Free Languages and Pushdown Automata, in Handbook of Formal Languages, chapter 3 (Springer, Berlin, 1997), pp. 111–174

    Google Scholar 

  2. B. Courcelle, On jump deterministic pushdown automata. Math. Syst. Theory 11, 87–109 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. S. Ginsburg, S.A. Greibach, M. Harrison, One-way stack automata. J. ACM 14(2), 389–418 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  4. S.A. Greibach, Checking automata and one-way stack languages. J. Comput. Syst. Sci. 3, 196–217 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  5. S. Ginsburg, E. Spanier, Finite-turn pushdown automata. SIAM J. Control 4, 429–453 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  6. D. Kolář, A. Meduna, Regulated pushdown automata. Acta Cybernetica 2000(4), 653–664 (2000)

    MathSciNet  MATH  Google Scholar 

  7. A. Meduna, Automata and Languages: Theory and Applications (Springer, London, 2000)

    Book  MATH  Google Scholar 

  8. A. Meduna, Simultaneously one-turn two-pushdown automata. Int. J. Comput. Math. 2003(80), 679–687 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. P. Sarkar, Pushdown automaton with the ability to flip its stack, in TR01-081, Electronic Colloquium on Computational Complexity (ECCC), 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brno University of Technology, Brno, Czech Republic

    Alexander Meduna

  2. Department of Information Technology, Brno University of Technology, Brno, Czech Republic

    Ondřej Soukup

Authors
  1. Alexander Meduna
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ondřej Soukup
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Meduna, A., Soukup, O. (2017). Algebra, Automata, and Computation. In: Modern Language Models and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-63100-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63100-4_10

  • 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)

Publish with us

Policies and ethics

Search

Navigation