Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP International Conference on Theoretical Computer Science

TCS 2012: Theoretical Computer Science pp 28–42Cite as

  1. Home
  2. Theoretical Computer Science
  3. Conference paper
Input-Driven Stack Automata

Input-Driven Stack Automata

  • Suna Bensch18,
  • Markus Holzer19,
  • Martin Kutrib19 &
  • …
  • Andreas Malcher19 
  • Conference paper
  • 797 Accesses

  • 9 Citations

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

Abstract

We introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely determine the operations on the pushdown store. This can nicely be generalized to stack automata by further types of input letters which are responsible for moving the stack pointer up or down. While visibly pushdown languages share many desirable properties with regular languages, input-driven stack automata languages do not necessarily so. We prove that deterministic and nondeterministic input-driven stack automata have different computational power, which shows in passing that one cannot construct a deterministic input-driven stack automaton from a nondeterministic one. We study the computational capacity of these devices. Moreover, it is shown that the membership problem for nondeterministic input-driven stack automata languages is NP-complete.

Keywords

  • Regular Language
  • Strict Inclusion
  • Kolmogorov Complexity
  • Input Symbol
  • Weak Mode

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56, Article 16 (2009)

    Google Scholar 

  2. von Braunmühl, B., Verbeek, R.: Input-driven Languages are Recognized in logn Space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 40–51. Springer, Heidelberg (1983)

    CrossRef  Google Scholar 

  3. Chervet, P., Walukiewicz, I.: Minimizing Variants of Visibly Pushdown Automata. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 135–146. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  4. Chomsky, N.: Formal Properties of Grammars. In: Handbook of Mathematic Psychology, vol. 2, pp. 323–418. Wiley & Sons (1962)

    Google Scholar 

  5. Crespi Reghizzi, S., Mandrioli, D.: Operator Precedence and the Visibly Pushdown Property. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 214–226. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  6. Dymond, P.W.: Input-driven languages are in logn depth. Inform. Process. Lett. 26, 247–250 (1988)

    CrossRef  MathSciNet  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman (1979)

    Google Scholar 

  8. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland (1975)

    Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Han, Y.S., Salomaa, K.: Nondeterministic state complexity of nested word automata. Theoret. Comput. Sci. 410, 2961–2971 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Hunt, H.: On the complexity of finite, pushdown and stack automata. Math. Systems Theory 10, 33–52 (1976)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Kutrib, M., Malcher, A.: Reversible Pushdown Automata. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 368–379. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  13. Lange, K.J.: A note on the P-completeness of deterministic one-way stack languages. J. Univ. Comput. Sci. 16, 795–799 (2010)

    MATH  Google Scholar 

  14. Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer (1993)

    Google Scholar 

  15. Mehlhorn, K.: Pebbling Mountain Ranges and Its Application of DCFL-recongnition. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422–435. Springer, Heidelberg (1980)

    CrossRef  Google Scholar 

  16. Okhotin, A., Salomaa, K.: State Complexity of Operations on Input-Driven Pushdown Automata. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 485–496. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  17. Piao, X., Salomaa, K.: Operational state complexity of nested word automata. Theoret. Comput. Sci. 410, 3290–3302 (2009)

    CrossRef  MathSciNet  Google Scholar 

  18. Salomaa, A.: Formal Languages. ACM Monograph Series. Academic Press (1973)

    Google Scholar 

  19. Shamir, E., Beeri, C.: Checking Stacks and Context-free Programmed Grammars Accept P-complete Languages. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14, pp. 27–33. Springer, Heidelberg (1974)

    CrossRef  Google Scholar 

  20. Sudborough, I.H.: On the tape complexity of deterministic context-free languages. J. ACM 25, 405–414 (1978)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Umeå University, 90187, Umeå, Sweden

    Suna Bensch

  2. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Markus Holzer, Martin Kutrib & Andreas Malcher

Authors
  1. Suna Bensch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andreas Malcher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Jos C. M. Baeten & Frank S. de Boer & 

  2. Microsoft Research, One Microsoft Way, 98052, Redmond, WA, USA

    Tom Ball

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Bensch, S., Holzer, M., Kutrib, M., Malcher, A. (2012). Input-Driven Stack Automata. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33475-7_3

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-33475-7_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33474-0

  • Online ISBN: 978-3-642-33475-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature