On the power of tree-walking automata

Information and Computation

Volumn 183, Issue 1, 2003, Pages 86-103

  Nevena, Frank ^a   Schwentickb, Thomas ^b  

^a HASSELT UNIVERSITY   (Belgium)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

Formal languages; Logic; Regular tree languages; Tree walking automata

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; FORMAL LANGUAGES; MATHEMATICAL MODELS; TREES (MATHEMATICS); XML;

TREE-WALKING AUTOMATA (TWA);

AUTOMATA THEORY;

EID: 0038486147     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00013-0     Document Type: Article

References (22)

1. S. Abiteboul, P. Buneman, D. Suciu, Data on the Web: From Relations to Semistructured Data and XML, Morgan Kaufmann, San Mateo, CA, 1999.
2. A.V. Aho, J.D. Ullman, Translations on a context-free grammar, Inform. Contr. 19 (1971) 439-475.
3. Y. Bargury, J.A. Makowsky, The expressive power of transitive closure logic and 2-way multi-head automats, in: E. Borger, G. Jäger, H.K. Büning, M.M. Richter (Eds.), Computer Science Logic, Lecture Notes in Computer Science, vol. 626, Springer, Berlin, 1991, pp. 1-14.
4. G.J. Bex, S. Maneth, F. Neven, A formal model for an expressive fragment of XSLT, Inform. Syst. 27 (1) (2002) 21-39.
5. R. Bloem, J. Engelfriet, A comparison of tree transductions denned by monadic second order logic and by attribute grammars, J. Comput. System Sci. 61 (2000) 1-50.
6. A. Brüggeman-Klein, S. Hermann, D. Wood, Context, caterpillars, tree automata, and tree pattern matching, in: Proceedings of the 4th International Conference on Developments in Language Theory, 1999.
7. J. Clark, XSL Transformations version 1.0, 1999. Available from http://www.w3.org/TR/xslt.
8. H.-D. Ebbinghaus, J. Flum, Finite Model Theory, Springer, Berlin/New York, 1995.
9. J. Engelfriet, H.J. Hoogeboom, Tree-walking pebble automata, in: J. KarhumKi, H. Mauler, O. Paun, G. Rozenberg (Eds.), Jewels are Forever. Contributions to Theoretical Computer Science in Honor of Arto Salomaa, Springer, Berlin, 1999, pp. 72-83.
10. J. Engelfriet, H.J. Hoogeboom, private communication.
11. J. Engelfriel, H.J. Hoogeboom, J.-P. van Best, Trips on trees, Acta Cybernetica 14 (1999) 51-64.
12. Z. Fülöp, S. Maneth, Domains of partial attributed tree transducers, Inform. Process. Lett. 73 (2000) 175-180.
13. H. Gaifman, On local and nonlocal properties, in: J. Stern (Ed.), Logic Colloquium '81, North-Holland, Amsterdam, 1982, pp. 105-135.
14. P. Gécseg, M. Steinby, Tree languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer, Berlin/New York, 1997 (Chapter 1).
15. N. Immerman, Descriptive Complexity, Springer, Berlin/New York, 1998.
16. T. Kamimura, G. Slutzki, Parallel and two-way automata on directed ordered acyclic graphs, Inform. Contr. 49 (1) (1981) 10-51.
17. T. Milo, D. Suciu, V. Vianu, Type checking for XML transformers, in: Proceedings of the Nineteenth ACM Symposium on Principles of Database Systems (PODS 2000), Assoc. Comput. Mach. Press, New York, 2000, pp. 11-22.
18. F. Neven. Design and analysis of query languages for structured documents - a formal and logical approach, Doctor's Thesis, Limburgs Universitair Centrum, 1999.
19. F. Neven, T. Schwentick, Expressive and efficient pattern languages for tree-structured data, in: Proceedings of 19th ACM Symposium on Principles of Database Systems (PODS 2000), Dallas, 2000, pp. 145-156.
20. A. Potthoff, Logische Klassifizierung Regulärer Baumsprachen, Doctor's Thesis, Institut für Informatik u. Prakt Math., Universität Kiel, 1994.
21. Deleted in proof.
22. W. Thomas, Languages, automata, and logic, in: G. Rozenberg. A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer, Berlin/New York, 1997, Chapter 7.