Skip to main content
SpringerLink
Log in

Tree-Walking Pebble Automata

  • Chapter
Jewels are Forever

Summary

The tree languages accepted by (finite state) tree-walking automata are known to form a subclass of the regular tree languages which is not known to be proper. They include all locally first-order definable tree languages. We allow the tree-walking automaton to use a finite number of pebbles, which have to be dropped and lifted in a nested fashion. The class of tree languages accepted by these tree-walking pebble automata contains all first-order definable tree languages and is still included in the class of regular tree languages. It also contains all deterministic top-down recognizable tree languages.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  Google Scholar 

  2. R. Bloem, J. Engelfriet; Monadic second order logic and node relations on graphs and trees, in J. Mycielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, Lecture Notes in Computer Science 1261 , Springer-Verlag, 1997, pp. 144–161.

    Google Scholar 

  3. R. Bloem, J. Engelfriet; Characterization of properties and relations defined in monadic second order logic on the nodes of trees, Tech. Report 97–03, Leiden University, August 1997.

    Google Scholar 

  4. M. Blum, C. Hewitt; Automata on a 2-dimensional tape, in Proc. 8th IEEE Symp. on Switching and Automata Theory, pp. 155–160, 1967.

    Google Scholar 

  5. M. Blum, D. Kozen; On the power of the compass (or, why mazes are easier to search than graphs), Proc. 19th FOCS (Annual Symposium on Foundations of Computer Science), 1978, pp. 132–142.

    Google Scholar 

  6. J. Büchi; Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlag. Math. 6 (1960), 66–92.

    Article  Google Scholar 

  7. J. Doner; Tree acceptors and some of their applications, J. of Comp. Syst. Sei. 4 (1970), 406–451.

    Article  MathSciNet  MATH  Google Scholar 

  8. CC. Elgot; Decision problems of finite automata and related arithmetics, Trans. Amer. Math. Soc. 98 (1961), 21–51.

    Google Scholar 

  9. J. Engelfriet, H.J. Hoogeboom, J.P. van Best; Trips on trees, Manuscript, 1999, to appear in Acta Cybernetica.

    Google Scholar 

  10. J. Engelfriet, G. Rozenberg, G. Slutzki; Tree transducers, L systems, and two-way machines, J. of Comp. Syst. Sei. 20 (1980), 150–202.

    Article  MathSciNet  MATH  Google Scholar 

  11. F. Gécseg, M. Steinby; Tree Automata, Akadémiai Kiadó, Budapest, 1984.

    MATH  Google Scholar 

  12. F. Gécseg, M. Steinby; Tree Languages, in G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3: Beyond Words, Chapter 1, Springer-Verlag, 1997.

    Google Scholar 

  13. N. Globerman, D. Harel; Complexity results for two-way and multi-pebble automata and their logics, Theor. Comput. Sei. 169 (1996), 161–184.

    Article  MathSciNet  MATH  Google Scholar 

  14. T. Kamimura, G. Slutzki; Parallel and two-way automata on directed ordered acyclic graphs, Inf. and Control 49 (1981), 10–51.

    Article  MathSciNet  MATH  Google Scholar 

  15. M.O. Rabin, D. Scott; Finite automata and their decision problems, IBM J. Res. Devel. 3 (1959), 115–125.

    Article  MathSciNet  Google Scholar 

  16. J.C. Shepherdson; The reduction of two-way automata to one-way automata, IBM J. Res. Devel. 3 (1959), 198–200.

    Article  MathSciNet  Google Scholar 

  17. M. Sipser; Halting space-bounded computations, Proc. 19th FOCS (Annual Symposium on Foundations of Computer Science), 1978, pp. 73–74.

    Google Scholar 

  18. J.W. Thatcher, J.B. Wright; Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory 2 (1968), 57–81.

    Article  MathSciNet  Google Scholar 

  19. W. Thomas; Languages, Automata, and Logic, in G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3: Beyond Words, Chapter 7, Springer-Verlag, 1997.

    Google Scholar 

  20. J.P. van Best; Tree-Walking Automata and Monadic Second Order Logic, Master’s Thesis, Leiden University, July 1998 http://www.wi.LeidenUniv.nl/MScThesis/IR98-06.html.

Download references

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hendrik Jan Hoogeboom
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Turku Centre for Computer Science, University of Turku, FIN-20014, Turku, Finland

    Juhani Karhumäki

  2. Institutes for Information Processing and Computer Supported Media (IICM), Technical University of Graz, Schiessstattgasse 4a, A-8010, Graz, Austria

    Hermann Maurer

  3. Institute of Mathematics, Romanian Academy of Sciences, PO Box l-764, RO-70700, Bucharest, Romania

    Gheorghe Păun

  4. Department of Computer Science, Leiden University, PO Box 9512, 2300 RA, Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Engelfriet, J., Hoogeboom, H.J. (1999). Tree-Walking Pebble Automata. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds) Jewels are Forever. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60207-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60207-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-60207-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation