Skip to main content
SpringerLink
Log in

Tree-Walking-Storage Automata

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

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

Included in the following conference series:

Abstract

We introduce and investigate tree-walking-storage automata, which are finite-state devices equipped with a tree-like storage. The automata are generalized stack automata, where the linear stack storage is replaced by a non-linear tree-like stack. Therefore, tree-walking-storage automata have the ability to explore the interior of the tree storage without altering the contents, where the possible moves of the tree pointer correspond to those of tree walking automata. In addition, a tree-walking-storage automaton can append (push) non-existent descendants to a tree node and remove (pop) leaves from the tree. As for classical stack automata, we also consider non-erasing and checking variants. As first steps to investigate these models we consider the computational capacities of deterministic one-way variants. In particular, a main focus is on the comparisons of the different variants of tree-walking-storage automata as well as on the comparisons with classical stack automata, and we can draw a complete picture.

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

Similar content being viewed by others

References

  1. Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Inform. Control 19, 439–475 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bensch, S., Björklund, J., Kutrib, M.: Deterministic stack transducers. Int. J. Found. Comput. Sci. 28, 583–601 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bojańczyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350, 164–173 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bojańczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. SIAM J. Comput. 38, 658–701 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Denkinger, T.: An automata characterisation for multiple context-free languages. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 138–150. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53132-7_12

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Golubski, W., Lippe, W.: Tree-stack automata. Math. Syst. Theory 29, 227–244 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Guessarian, I.: Pushdown tree automata. Math. Syst. Theory 16, 237–263 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gurari, E.M., Ibarra, O.H.: (Semi)alternating stack automata. Math. Syst. Theory 15, 211–224 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hopcroft, J.E., Ullman, J.D.: Nonerasing stack automata. J. Comput. Syst. Sci. 1, 166–186 (1967)

    Article  MATH  Google Scholar 

  13. Hopcroft, J.E., Ullman, J.D.: Deterministic stack automata and the quotient operator. J. Comput. Syst. Sci. 2, 1–12 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hopcroft, J.E., Ullman, J.D.: Sets accepted by one-way stack automata are context sensitive. Inform. Control 13, 114–133 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  15. 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, 88–117 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ibarra, O.H., Jirásek, J., McQuillan, I., Prigioniero, L.: Space complexity of stack automata models. Int. J. Found. Comput. Sci. 32, 801–823 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ibarra, O.H., McQuillan, I.: Variations of checking stack automata: obtaining unexpected decidability properties. Theor. Comput. Sci. 738, 1–12 (2018). https://doi.org/10.1016/j.tcs.2018.04.024

    Article  MathSciNet  MATH  Google Scholar 

  18. Ibarra, O.H., McQuillan, I.: Generalizations of checking stack automata: characterizations and hierarchies. Int. J. Found. Comput. Sci. 32, 481–508 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kosaraju, S.R.: 1-way stack automaton with jumps. J. Comput. Syst. Sci. 9, 164–176 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kutrib, M., Malcher, A., Wendlandt, M.: Tinput-driven pushdown, counter, and stack automata. Fund. Inform. 155, 59–88 (2017)

    MathSciNet  MATH  Google Scholar 

  21. Lange, K.: A note on the P-completeness of deterministic one-way stack language. J. UCS 16, 795–799 (2010)

    MathSciNet  MATH  Google Scholar 

  22. Ogden, W.F.: Intercalation theorems for stack languages. In: Proceedings of the First Annual ACM Symposium on Theory of Computing (STOC 1969), pp. 31–42. ACM Press, New York (1969)

    Google Scholar 

  23. 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). https://doi.org/10.1007/978-3-662-21545-6_3

    Chapter  MATH  Google Scholar 

  24. Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)

    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

  2. Technische Hochschule Mittelhessen, Wiesenstr. 14, 35390, Giessen, Germany

    Uwe Meyer

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Meyer
    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. Umeå University, Umeå, Sweden

    Frank Drewes

  2. Ural Federal University, Ekaterinburg, Russia

    Mikhail Volkov

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., Meyer, U. (2023). Tree-Walking-Storage Automata. In: Drewes, F., Volkov, M. (eds) Developments in Language Theory. DLT 2023. Lecture Notes in Computer Science, vol 13911. Springer, Cham. https://doi.org/10.1007/978-3-031-33264-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-33264-7_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-33263-0

  • Online ISBN: 978-3-031-33264-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation