Automata and logics for unranked and unordered trees

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 500-515

  Boneva, Iovka ^a   Talbot, Jean Marc ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DATA ACQUISITION; LOGIC PROGRAMMING;

MONADIC SECOND ORDER (MSO) LOGIC; UNORDERED TREES;

TREES (MATHEMATICS);

EID: 24944560618     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_36     Document Type: Conference Paper

References (20)

1. J. Carme, J. Niehren, and M. Tommasi. Querying Unranked Trees with Stepwise Tree Automata. In International Conference on Rewriting Techniques and Applications, volume 3091 of LNCS, pages 105-118. Springer, 2004.
2. T. Colcombet. Rewriting in the partial algebra of typed terms modulo AC. In Electronic Notes in Theoretical Computer Science, volume 68. Elsevier Science Publishers, 2002.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release October, 1rst 2002.
4. B. Courcelle. The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. IC, 85(1):12-75, 1990.
5. B. Courcelle. The monadic second order logic of graphs VI: on several representations of graphs by relational structures. Discrete Applied Mathematics, 54(2-3):117-149, 1994.
6. B. Courcelle. Basic notions of universal algebra for language theory and graph grammars. Theoretical Computer Science, 163:1-54, 1996.
7. S. Dal-Zilio and D. Lugiez. XML Schema, Tree Logic and Sheaves Automata. In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, volume 2706 of LNCS, pages 246-263. Springer, 2003.
8. S. Dal-Zilio, D. Lugiez, and C. Meyssonnier. A logic you can count on. In 31st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004.
9. m. Journal of Computer System Sciences, 59(3):373-391, 1999.
10. G. Guaiana, A. Restivo, and S. Salemi. On Aperiodic Trace Languages. In STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer, volume 480 of LNCS, pages 76-88. Springer, 1991.
11. F. Klaedtke and H. Rueß. Monadic Second-Order Logics with Cardinalities. In 30th International Colloquium on Automata, Languages and Programming, ICALP 2003, volume 2719 of Lecture Notes in Computer Science, Springer Verlag, 2003.
12. J. Mezei and J.B. Wright. Algebraic automata and context-free sets. Information and Control, 11(2-3):3-29, 1967.
13. F. Neven and T. Schwentick. Query automata over finite trees. Theoretical Computer Science, 275(1-2):633-674, March 2002.
14. J. Niehren and A. Podelski. Feature Automata and Recognizable Sets of Feature Trees. In Theory and Practice of Software Development, International Joint Conference CAAP/FASE/TOOLS, volume 668 of LNCS, pages 356-375. Springer, 1993.
15. H. Ohsaki. Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. In Proceedings of 15th International Conference of the European Association for Computer Science Logic - CSL 2001, volume 2142 of LNCS, pages 539-553. Springer, 2001.
16. H. Ohsaki and T. Takai. Decidability and Closure Properties of Equational Tree Languages. In Proceedings of 13th International Conference on Rewriting Techniques and Applications, volume 2378 of LNCS, pages 114-128. Springer, 2002.
17. R. J. Parikh. On context-free languages. Journal of the ACM, 13(4):570-581, 1966.
18. H. Seidl, T. Schwentick, and A. Muscholl. Numerical Document Queries. In Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 155-166. ACM, 2003.
19. J. W. Thatcher and J. B. Wright. Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory, 2:57-82, 1968.
20. K. N. Verma. Two-Way Equational Tree Automata for AC-like Theories: Decidability and Closure Properties. In Proceedings of 14th International Conference on Rewriting Techniques and Applications, volume 2706 of LNCS, pages 180-197. Springer, 2003.