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.
KeywordsCurrent Node Atomic Formula Regular Language Finite Automaton Node Variable
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 17.M. Sipser; Halting space-bounded computations, Proc. 19th FOCS (Annual Symposium on Foundations of Computer Science), 1978, pp. 73–74.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.