Skip to main content
SpringerLink
Log in

Sweeping Input-Driven Pushdown Automata

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14151))

Included in the following conference series:

  • 177 Accesses

Abstract

Input-driven pushdown automata (\(\text {IDPDA}\)) are pushdown automata where the next action on the pushdown store (push, pop, nothing) is solely governed by the input symbol. Here, we introduce sweeping input-driven pushdown automata that process the input in multiple passes (also sweeps). That is, a sweeping input-driven pushdown automaton is a two-way device that may change the input head direction only at the endmarkers. First we show that, given an arbitrary \(\text {SIDPDA}\), an equivalent \(\text {SIDPDA}\) that halts on any input can effectively be constructed. From this result further properties follow. Then we address the determinization of \(\text {SIDPDA}\)s and its descriptional complexity. Furthermore, the computational capacity of \(\text {SIDPDA}\)s is studied. To this end, we compare the family \(\mathscr {L}(\text {SIDPDA})\) with other well-known language families. In particular, we are interested in families that have strong relations to some kind of pushdown machines.

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.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. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Time and tape complexity of pushdown automaton languages. Inform. Control 13, 186–206 (1968)

    Article  MATH  Google Scholar 

  2. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Symposium on Theory of Computing (STOC 2004), pp. 202–211. ACM (2004)

    Google Scholar 

  3. Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM56 (2009)

    Google Scholar 

  4. Bensch, S., Holzer, M., Kutrib, M., Malcher, A.: Input-driven stack automata. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 28–42. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33475-7_3

    Chapter  Google Scholar 

  5. Book, R.V.: Time-bounded grammars and their languages. J. Comput. Syst. Sci. 5, 397–429 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  6. Book, R.V.: On the complexity of formal grammars. Acta Inform. 9, 171–181 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. von Braunmühl, B., Verbeek, R.: Input-driven languages are recognized in \(\log n\) space. In: Topics in the Theory of Computation, Mathematics Studies, vol. 102, pp. 1–19. North-Holland (1985)

    Google Scholar 

  8. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inform. Comput. 141, 1–36 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Carotenuto, D., Murano, A., Peron, A.: Ordered multi-stack visibly pushdown automata. Theor. Comput. Sci. 656, 1–26 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Caucal, D.: Synchronization of pushdown automata. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 120–132. Springer, Heidelberg (2006). https://doi.org/10.1007/11779148_12

    Chapter  Google Scholar 

  11. 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). https://doi.org/10.1007/978-3-540-74456-6_14

    Chapter  MATH  Google Scholar 

  12. Crespi-Reghizzi, S., Mandrioli, D.: Operator precedence and the visibly pushdown property. J. Comput. Syst. Sci. 78, 1837–1867 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dahlhaus, E., Warmuth, M.K.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33, 456–472 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dartois, L., Filiot, E., Reynier, P., Talbot, J.: Two-way visibly pushdown automata and transducers. In: Logic in Computer Science (LICS 2016). pp. 217–226. ACM (2016)

    Google Scholar 

  15. Dymond, P.W.: Input-driven languages are in \(\log n\) depth. Inform. Process. Lett. 26, 247–250 (1988)

    Article  MathSciNet  Google Scholar 

  16. Gladkii, A.V.: On complexity of inference in phase-structure grammars. Algebra i Logika. Sem. 3, 29–44 (1964). (in Russian)

    MathSciNet  MATH  Google Scholar 

  17. Gray, J., Harrison, M.A., Ibarra, O.H.: Two-way pushdown automata. Inform. Control 11, 30–70 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  18. Harju, T.: A simulation result for the auxiliary pushdown automata. J. Comput. Syst. Sci. 19, 119–132 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kutrib, M., Malcher, A.: Digging input-driven pushdown automata. RAIRO Inform. Théor. 55, Art. 6 (2021)

    Google Scholar 

  20. Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M.: Deterministic input-driven queue automata: finite turns, decidability, and closure properties. Theor. Comput. Sci. 578, 58–71 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kutrib, M., Malcher, A., Wendlandt, M.: On the power of pushing or stationary moves for input-driven pushdown automata. In: Implementation and Application of Automata (CIAA 2022). LNCS, vol. 13266, pp. 140–151. Springer (2022). https://doi.org/10.1007/978-3-031-07469-1_11

  22. La Torre, S., Napoli, M., Parlato, G.: Scope-bounded pushdown languages. Int. J. Found. Comput. Sci. 27, 215–234 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  23. Leung, H.: Tight lower bounds on the size of sweeping automata. J. Comput. Syst. Sci. 63, 384–393 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Malcher, A., Mereghetti, C., Palano, B.: Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. 449, 119–133 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  25. Mehlhorn, Kurt: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, Jaco, van Leeuwen, Jan (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 

  26. Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. SIGACT News 45, 47–67 (2014)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Martin Kutrib

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Kutrib .

Editor information

Editors and Affiliations

  1. Eastern Mediterranean University, Famagusta, Cyprus

    Benedek Nagy

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kutrib, M. (2023). Sweeping Input-Driven Pushdown Automata. In: Nagy, B. (eds) Implementation and Application of Automata. CIAA 2023. Lecture Notes in Computer Science, vol 14151. Springer, Cham. https://doi.org/10.1007/978-3-031-40247-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-40247-0_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-40246-3

  • Online ISBN: 978-3-031-40247-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation