Skip to main content
SpringerLink
Log in
Book cover

International Conference on Language and Automata Theory and Applications

LATA 2008: Language and Automata Theory and Applications pp 1–2Cite as

Tree-Walking Automata

  • Conference paper

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

Abstract

A survey of tree-walking automata. The main focus is on how the expressive power is changed by adding features such as pebbles or nondeterminism.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

References

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

    Article  MathSciNet  Google Scholar 

  2. Bojańczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: ACM Symposium on the Theory of Computing, pp. 234–243 (2005)

    Google Scholar 

  3. Bojańczyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. Theoretical Computer Science 350(2-3), 255–272 (2006)

    Article  Google Scholar 

  4. Bojańczyk, M., Samuelides, M., Schwentick, T., Segoufin, L.: Expressive power of pebble automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 157–168. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. ten Cate, B., Segoufin, L.: XPath, transitive closure logic, and nested tree walking automata. In: Principles of Database Systems (2007)

    Google Scholar 

  6. Engelfriet, J., Hoogeboom, H., Van Best, J.: Trips on trees. Acta Cybernetica 14(1), 51–64 (1999)

    MATH  MathSciNet  Google Scholar 

  7. Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Paum, G., Karhumaki, J., Maurer, H., Rozenberg, G. (eds.) Jewels Are Forever, Contributions to Theoretical Computer Science in Honor of Arto Salomaa, pp. 72–83. Springer, Heidelberg (1999)

    Google Scholar 

  8. Engelfriet, J., Hoogeboom, H.J.: Automata with nested pebbles capture first-order logic with transitive closure. Logical Methods in Computer Science, 3(2:3) (2007)

    Google Scholar 

  9. Engelfriet, J., Hoogeboom, H.J., Samwel, B.: XML transformation by tree-walking transducers with invisible pebbles. In: Principles of Database Systems, pp. 63–72 (2007)

    Google Scholar 

  10. Muscholl, A., Samuelides, M., Segoufin, L.: Complementing deterministic tree-walking automata. Information Processing Letters 99(1), 33–39 (2006)

    Article  MathSciNet  Google Scholar 

  11. Neven, F., Schwentick, T.: On the power of tree-walking automata. In: Welzl, E., Montanari, U., Rolim, J. (eds.) ICALP 2000. LNCS, vol. 1853. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Samuelides, M., Segoufin, L.: Complexity of pebble tree-walking automata. In: Fundamentals of Computation Theory, pp. 458–469 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw University,  

    Mikołaj Bojańczyk

Authors
  1. Mikołaj Bojańczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bojańczyk, M. (2008). Tree-Walking Automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88281-7

  • Online ISBN: 978-3-540-88282-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation