Skip to main content
SpringerLink
Log in

Input-Driven Pushdown Automata on Well-Nested Infinite Strings

  • Conference paper
  • First Online:
Book cover Computer Science – Theory and Applications (CSR 2021)

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

Included in the following conference series:

Abstract

Automata operating on strings of nested brackets, known as input-driven pushdown automata, and also as visibly pushdown automata, have been studied since the 1980s. They were extended to the case of infinite strings by Alur and Madhusudan (“Visibly pushdown languages”, STOC 2004). This paper investigates the properties of these automata under the assumption that a given infinite string is always well-nested. This restriction enables a complete characterization of the corresponding \(\omega \)-languages in terms of classical \(\omega \)-regular languages and input-driven pushdown automata on finite strings. This characterization leads to a determinization construction for these automata, as well as to the first results on their topological classification.

This work was supported by the Russian Science Foundation, project 18-11-00100.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: ACM Symposium on Theory of Computing (STOC 2004), Chicago, USA, 13–16 June 2004, pp. 202–211 (2004). https://doi.org/10.1145/1007352.1007390

  2. Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1–43 (2009). https://doi.org/10.1145/1516512.1516518

    Article  MathSciNet  MATH  Google Scholar 

  3. von Braunmühl, B., Verbeek, R.: Input driven languages are recognized in log n space. In: Annals of Discrete Mathematics, vol. 24, pp. 1–20 (1985). https://doi.org/10.1016/S0304-0208(08)73072-X

  4. Duparc, J.: A hierarchy of deterministic context-free \(\omega \)-languages. Theor. Comput. Sci. 290(3), 1253–1300 (2003)

    Article  MathSciNet  Google Scholar 

  5. Duparc, J., Vuilleumier, L.: The Wadge order on the Scott domain is not a well-quasi-order. J. Symb. Log. 85(1), 300–324 (2020)

    Article  MathSciNet  Google Scholar 

  6. Finkel, O.: Topological complexity of context-free \(\omega \)-languages: a survey. In: Dershowitz, N., Nissan, E. (eds.) Language, Culture, Computation. Computing - Theory and Technology. LNCS, vol. 8001, pp. 50–77. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-45321-2_4

    Chapter  Google Scholar 

  7. Löding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 408–420. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30538-5_34

    Chapter  Google Scholar 

  8. Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422–435. Springer, Heidelberg (1980). https://doi.org/10.1007/3-540-10003-2_89

    Chapter  Google Scholar 

  9. Motto Ros, L., Schlicht, P., Selivanov, V.: Wadge-like reducibilities on arbitrary quasi-Polish spaces. Math. Struct. Comput. Sci. 25(8), 1705–1754 (2015)

    Article  MathSciNet  Google Scholar 

  10. Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. In: SIGACT News, vol. 45, no. 2, pp. 47–67 (2014). https://doi.org/10.1145/2636805.2636821

  11. Okhotin, A., Salomaa, K.: Descriptional complexity of unambiguous input-driven pushdown automata. Theor. Comput. Sci. 566, 1–11 (2015). https://doi.org/10.1016/j.tcs.2014.11.015

    Article  MathSciNet  MATH  Google Scholar 

  12. Okhotin, A., Salomaa, K.: State complexity of operations on input-driven pushdown automata. J. Comput. Syst. Sci. 86, 207–228 (2017). https://doi.org/10.1016/j.jcss.2017.02.001

    Article  MathSciNet  MATH  Google Scholar 

  13. Wadge, W.: Reducibility and determinateness in the Baire space. PhD thesis, University of California, Berkely (1984)

    Google Scholar 

  14. Wagner, K.: On \(\omega \)-regular sets. Inf. Control 43, 123–177 (1979)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, St. Petersburg State University, 7/9 Universitetskaya Nab., Saint Petersburg, 199034, Russia

    Alexander Okhotin

  2. A. P. Ershov Institute of Informatics Systems, Novosibirsk, Russia

    Victor L. Selivanov

Authors
  1. Alexander Okhotin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor L. Selivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Okhotin .

Editor information

Editors and Affiliations

  1. University of Oxford, Oxford, UK

    Rahul Santhanam

  2. Innovations & HighTech, Moscow Institute of Physics and Technology, Moscow, Russia

    Daniil Musatov

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Okhotin, A., Selivanov, V.L. (2021). Input-Driven Pushdown Automata on Well-Nested Infinite Strings. In: Santhanam, R., Musatov, D. (eds) Computer Science – Theory and Applications. CSR 2021. Lecture Notes in Computer Science(), vol 12730. Springer, Cham. https://doi.org/10.1007/978-3-030-79416-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-79416-3_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-79415-6

  • Online ISBN: 978-3-030-79416-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation