Expressive power of pebble automata

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

Volumn 4051 LNCS, Issue , 2006, Pages 157-168

  Bojańczyk, Mikołaj ^a,b   Samuelides, Mathias ^b   Schwentick, Thomas ^c   Segoufin, Luc ^d  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c TU DORTMUND UNIVERSITY   (Germany)

^d INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; FORMAL LANGUAGES; MATHEMATICAL MODELS; TREES (MATHEMATICS);

BINARY TREES; PEBBLE AUTOMATA;

AUTOMATA THEORY;

EID: 33746358858     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_15     Document Type: Conference Paper

References (10)

1. A. V. Aho, J. D. Ullman Translations on a Context-Free Grammar. In Information and Control, 19(5): 439-475, 1971.
2. M. Bojańczyk and T. Colcombet. Tree-Walking Automata Cannot Be Determinized. TCS, to appear.
3. M. Bojańczyk and T. Colcombet. Tree-walking automata do not recognize all regular languages. In STOC, 2005.
4. J. Engelfriet and H.J. Hoogeboom. Tree-walking pebble automata. In Jewels are forever, (J. Karhumäki et al., eds.), Springer-Verlag, 72-83, 1999.
5. J. Engelfriet and H.J. Hoogeboom. Nested Pebbles and Transitive Closure. In STACS, 2006.
6. J. Engelfriet, S. Maneth. A comparison of pebble tree transducers with macro tree transducers. In Acta Inf. 39(9): 613-698, 2003.
7. J. Engelfriet, H.-J. Hoogeboom, J.-P.Van Best. Trips on Trees. In Acta Cybern. 14(1): 51-64, 1999.
8. T. Milo, D. Suciu and V. Vianu. Typechecking for XML transformers. In J. Comput. Syst. Sci., 66(1): 66-97, 2003.
9. A. Muscholl, M. Samuelides and L. Segoufin. Complementing deterministic tree-walking automata. In IPL, to appear.
10. H. Comon et al. Tree Automata Techniques and Applications. Available at http://www.grappa.univ-lille3.fr/tata