Advertisement

Tree-Walking Pebble Automata

  • Joost Engelfriet
  • Hendrik Jan Hoogeboom

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.

Keywords

Current Node Atomic Formula Regular Language Finite Automaton Node Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.V. Aho and J.D. Ullman; Translations on a context free grammar, Inform, and Control 19 (1971), 439–475.MathSciNetCrossRefGoogle Scholar
  2. 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. 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. 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. 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. 6.
    J. Büchi; Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlag. Math. 6 (1960), 66–92.CrossRefGoogle Scholar
  7. 7.
    J. Doner; Tree acceptors and some of their applications, J. of Comp. Syst. Sei. 4 (1970), 406–451.MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    CC. Elgot; Decision problems of finite automata and related arithmetics, Trans. Amer. Math. Soc. 98 (1961), 21–51.Google Scholar
  9. 9.
    J. Engelfriet, H.J. Hoogeboom, J.P. van Best; Trips on trees, Manuscript, 1999, to appear in Acta Cybernetica.Google Scholar
  10. 10.
    J. Engelfriet, G. Rozenberg, G. Slutzki; Tree transducers, L systems, and two-way machines, J. of Comp. Syst. Sei. 20 (1980), 150–202.MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    F. Gécseg, M. Steinby; Tree Automata, Akadémiai Kiadó, Budapest, 1984.zbMATHGoogle Scholar
  12. 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. 13.
    N. Globerman, D. Harel; Complexity results for two-way and multi-pebble automata and their logics, Theor. Comput. Sei. 169 (1996), 161–184.MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    T. Kamimura, G. Slutzki; Parallel and two-way automata on directed ordered acyclic graphs, Inf. and Control 49 (1981), 10–51.MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    M.O. Rabin, D. Scott; Finite automata and their decision problems, IBM J. Res. Devel. 3 (1959), 115–125.MathSciNetCrossRefGoogle Scholar
  16. 16.
    J.C. Shepherdson; The reduction of two-way automata to one-way automata, IBM J. Res. Devel. 3 (1959), 198–200.MathSciNetCrossRefGoogle Scholar
  17. 17.
    M. Sipser; Halting space-bounded computations, Proc. 19th FOCS (Annual Symposium on Foundations of Computer Science), 1978, pp. 73–74.Google Scholar
  18. 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.MathSciNetCrossRefGoogle Scholar
  19. 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. 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.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Joost Engelfriet
  • Hendrik Jan Hoogeboom

There are no affiliations available

Personalised recommendations