Skip to main content
Springer Nature Link
Log in

Generalizations of Checking Stack Automata: Characterizations and Hierarchies

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11088))

Included in the following conference series:

  • 714 Accesses

Abstract

We examine different generalizations of checking stack automata (e.g., allowing multiple input heads and multiple stacks) and characterize their computing power in terms of two-way multi-head finite automata and space-bounded Turing machines. For various models, we obtain hierarchies in terms of their computing power. Our characterizations and hierarchies expand or tighten some previously known results.

The research of O. H. Ibarra was supported, in part, by NSF Grant CCF-1117708. The research of I. McQuillan was supported, in part, by Natural Sciences and Engineering Research Council of Canada Grant 2016-06172.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Ullman, J.D., Hopcroft, J.E.: On the computational power of pushdown automata. J. Comput. Syst. Sci. 4(2), 129–136 (1970)

    Article  MathSciNet  Google Scholar 

  2. Engelfriet, J.: The power of two-way deterministic checking stack automata. Inf. Comput. 80(2), 114–120 (1989)

    Article  MathSciNet  Google Scholar 

  3. Ginsburg, S., Greibach, S., Harrison, M.: Stack automata and compiling. J. ACM 14(1), 172–201 (1967)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  6. Ibarra, O.H.: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. J. Comput. Syst. Sci. 5(2), 88–117 (1971)

    Article  MathSciNet  Google Scholar 

  7. Ibarra, O.H.: On two-way multihead automata. J. Comput. Syst. Sci. 7(1), 28–36 (1973)

    Article  MathSciNet  Google Scholar 

  8. Ibarra, O.H., McQuillan, I.: Variations of checking stack automata: obtaining unexpected decidability properties. Theoret. Comput. Sci. 738, 1–12 (2018)

    Article  MathSciNet  Google Scholar 

  9. King, K., Wrathall, C.: Stack languages and log n space. J. Comput. Syst. Sci. 17(3), 281–299 (1978)

    Article  MathSciNet  Google Scholar 

  10. Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO. Informatique Théorique 14(1), 67–82 (1980)

    Article  MathSciNet  Google Scholar 

  11. Seiferas, J.I.: Relating refined space complexity classes. J. Comput. Syst. Sci. 14(1), 100–129 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  2. Department of Computer Science, University of Saskatchewan, Saskatoon, SK, S7N 5A9, Canada

    Ian McQuillan

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian McQuillan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ian McQuillan .

Editor information

Editors and Affiliations

  1. National Archives of Japan, Tokyo, Japan

    Mizuho Hoshi

  2. The University of Electro-Communications, Tokyo, Japan

    Shinnosuke Seki

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ibarra, O.H., McQuillan, I. (2018). Generalizations of Checking Stack Automata: Characterizations and Hierarchies. In: Hoshi, M., Seki, S. (eds) Developments in Language Theory. DLT 2018. Lecture Notes in Computer Science(), vol 11088. Springer, Cham. https://doi.org/10.1007/978-3-319-98654-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98654-8_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98653-1

  • Online ISBN: 978-3-319-98654-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics