Tree-walking automata

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

Volumn 5196 LNCS, Issue , 2008, Pages 1-2

  Bojańczyk, Mikołaj ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EXPRESSIVE POWERS;

LINGUISTICS; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 56449084019     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88282-4_1     Document Type: Conference Paper

References (12)

1. Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Information and Control 19, 439-475 (1971)
2. Bojańczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. In: ACM Symposium on the Theory of Computing, pp. 234-243 (2005)
3. Bojańczyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. Theoretical Computer Science 350(2-3), 255-272 (2006)
4. Bojańczyk, M., Samuelides, M., Schwentick, T., Segoufin, L.: Expressive power of pebble automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 157-168. Springer, Heidelberg (2006)
5. ten Cate, B., Segoufin, L.: XPath, transitive closure logic, and nested tree walking automata. In: Principles of Database Systems (2007)
6. Engelfriet, J., Hoogeboom, H., Van Best, J.: Trips on trees. Acta Cybernetica 14(1), 51-64 (1999)
7. Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Paum, G., Karhumaki, J., Maurer, H., Rozenberg, G. (eds.) Jewels Are Forever, Contributions to Theoretical Computer Science in Honor of Arto Salomaa, pp. 72-83. Springer, Heidelberg (1999)
8. Engelfriet, J., Hoogeboom, H.J.: Automata with nested pebbles capture first-order logic with transitive closure. Logical Methods in Computer Science, 3(2:3) (2007)
9. Engelfriet, J., Hoogeboom, H.J., Samwel, B.: XML transformation by tree-walking transducers with invisible pebbles. In: Principles of Database Systems, pp. 63-72 (2007)
10. Muscholl, A., Samuelides, M., Segoufin, L.: Complementing deterministic treewalking automata. Information Processing Letters 99(1), 33-39 (2006)
11. Neven, F., Schwentick, T.: On the power of tree-walking automata. In: Welzl, E., Montanari, U., Rolim, J. (eds.) ICALP2000.LNCS, vol. 1853. Springer,Heidelberg (2000)
12. Samuelides, M., Segoufin, L.: Complexity of pebble tree-walking automata. In: Fundamentals of Computation Theory, pp. 458-469 (2007)