Complexity of pebble tree-walking automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4639 LNCS, Issue , 2007, Pages 458-469

  Samuelides, Mathias ^a   Segoufin, Luc ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

PEBBLE TREE WALKING AUTOMATA;

AUTOMATA THEORY;

EID: 38149066609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_40     Document Type: Conference Paper

References (15)

1. Aho, A.V., Ullman, J.D.: Translations on a Context-Free Grammar. Information and Control 19(5), 439-475 (1971)
2. Bojańczyk, M., Colcombet, T.: Tree-Walking Automata Cannot Be Determinized. Theor. Comput. Sci. 350(2-3), 164-173 (2006)
3. Bojańczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: STOC (2005)
4. Bojańczyk, M., Samuelides, M., Schwentick, T., Segoufin, L.: Expressive power of pebble automata. In: ICALP (2006)
5. Comon, H., et al.: Tree Automata Techniques and Applications. Available at http://www.grappa.univ-lille3.fr/tata
6. Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable Optimization Problems for Database Logic Programs. In: STOC (1988)
7. Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Karhumäki, J., et al. (ed.) Jewels are forever, pp. 72-83. Springer, Heidelberg (1999)
8. Engelfriet, J., Hoogeboom, H.J.: Nested Pebbles and Transitive Closure. In: STACS (2006)
9. Engelfriet, J., Hoogeboom, H.J., Van Best, J.-P.: Trips on Trees. Acta Cybern. 14(1), 51-64 (1999)
10. Engelfriet, J., Maneth, S.: A comparison of pebble tree transducers with macro tree transducers. Acta Inf. 39(9), 613-698 (2003)
11. Globerman, N., Harel, D.: Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. Theor. Comput. Sci. 169(2), 161-184 (1996)
12. Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comput. Syst. Sci. 66(1), 66-97 (2003)
13. Muscholl, A., Samuelides, M., Segoufin, L.: Complementing deterministic tree-walking automata. IPL 99(1), 33-39 (2006)
14. Neven, F.: Extensions of Attribute Grammars for Structured Documents Queries. In: DBPL (1999)
15. Vardi, M.Y.: A note on the reduction of two-way automata to one-way automata. IPL 30, 261-264 (1989)