Tree automata and term rewrite systems

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

Volumn 1833, Issue , 2000, Pages 27-30

  Tison, Sophie ^a  

^a UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

REWRITING THEORY; STATE OF RESEARCH; TERM REWRITE SYSTEMS; TREE AUTOMATA;

FORESTRY;

INFORMATION RETRIEVAL; PROBLEM SOLVING; ROBOTS;

EID: 84937436496     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10721975_2     Document Type: Conference Paper

References (27)

1. W. S. Brainerd. Semi-thue systems and representations of trees. In Proc. 10th IEEE Symposium on Foundations of Computer Science (FOCS), pages 240–244, 1969.
2. W. S. Brainerd. Tree generating regular systems. Information and Control, 14(2):217–231, February 1969.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://l3ux02.univ-lille3.fr/tata, 1997.
4. J.L. Coquide, M. Dauchet, R. Gilleron, and S. Vagvolgyi. Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Theorical Computer Science, 127:69–98, 1994.
5. H. Comon and F. Jacquemard. Ground reducibility and automata with disequality constraints. In Patrice Enjalbert, editor, 11th Annual Symposium on Theoretical Aspects of Computer Science, volume 775 of LNCS, pages 151–162, 1994.
6. H. Comon and F. Jacquemard. Ground reducibility is EXPTIME-complete. In Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, pages 26–34. IEEE Computer Society Press, 1997.
7. H. Comon. Sequentiality, second-order monadic logic and tree automata. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 26–29 June 1995.
8. A.-C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Deciding the satisfiability of quantifier free formulae on one-step rewriting. In M. Rusi-nowitch F. Narendran, editor, 10th International Conference on Rewriting Techniques and Applications, volume 1631 of LNCS, Trento, Italy, 1999. Springer Verlag.
9. M. Dauchet. Rewriting and tree automata. In H. Comon and J.-P. Jouannaud, editors, Proc. Spring School on Theoretical Computer Science: Rewriting, LNCS, Odeillo, France, 1994. Springer Verlag.
10. M. Dauchet, A.-C. Caron, and J.-L. Coquidé. Reduction properties and automata with constraints. Journal of Symbolic Computation, 20:215–233, 1995
11. M. Dauchet and S. Tison. The theory of ground rewrite systems is decid-able. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 242–248. IEEE Computer Society Press, 4–7 June 1990.
12. A. Flp, E. Jurvanen, M. Steinby, and S. Vagvlgy. On one-pass term rewriting. In L. Brim, J. Gruska, and J. Zlatusaksv, editors, Proceedings of Mathematical Foundations of Computer Science, volume 1450 of LNCS, pages 248–256. Springer Verlag, 1998.
13. T. Genet. Decidable approximations of sets of descendants and sets of normal forms. In T. Nipkow, editor, 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 151–165, Tsukuba, Japan, 1998. Springer Verlag.
14. T. Genet and F. Klay. Rewriting for cryptographic protocol verification. Technical Report, INRIA, 2000, to appear in CADE2000, 2000.
15. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Sa-lomaa, editors, Handbook of Formal Languages, volume 3, pages 1–68. Springer Verlag, 1996.
16. R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundamenta Informaticae, 24:157–176, 1995.
17. F. Jacquemard. Decidable approximations of term rewriting systems. In H. Ganzinger, editor, Proceedings. Seventh International Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, 1996.
18. E. Kounalis. Testing for the ground (co)-reducibility in term rewriting systems. Theorical Computer Science, 106(1):87–117, 1992.
19. S. Limet and P. Réty. Solving Disequations modulo some Class of Rewrite System. In T. Nipkow, editor, 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 121–135, Tsukuba, Japan, 1998. Springer Verlag.
20. S. Limet and P. Réty. A new result about the decidability of the existential one-step rewriting theory. In M. Rusinowitch F. Narendran, editor, 10th International Conference on Rewriting Techniques and Applications, volume 1631 of LNCS, Trento, Italy, 1999. Springer Verlag.
21. T. Nagaya and Y. Toyama. Decidability for left-linear growing term rewriting systems. In M. Rusinowitch F. Narendran, editor, 10th International Conference on Rewriting Techniques and Applications, volume 1631 of LNCS, Trento, Italy, 1999. Springer Verlag.
22. F. Otto. On the connections between rewriting and formal languauge theory. In M. Rusinowitch F. Narendran, editor, 10th International Con ference on Rewriting Techniques and Applications, volume 1631 of LNCS, pages 332–355, Trento, Italy, 1999. Springer Verlag.
23. D.A. Plaisted. Semantic confluence tests and completion method. Information and Control, 65:182–215, 1985.
24. K. Salomaa. Deterministic tree pushdown automata and monadic tree rewriting systems. Journal of Comput. and Syst. Sci., 37:367–394, 1988.
25. F. Seynhaeve, S. Tison, and M. Tommasi. Homomorphisms and concurrent term rewriting. In G. Ciobanu and G. Paun, editors, Proceedings of the twelfth International Conference on Fundamentals of Computation theory, number 1684 in Lecture Notes in Computer Science, Iasi, Romania, 1999.
26. S. Vágvölgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable. Bulletin of the European Association of Theoretical Computer Science, 48:197–209, October 1992.
27. J. Waldmann. Normalization of s-terms is decidable. In T. Nipkow, editor, 9th International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 138–150, Tsukuba, Japan, 1998. Springer Verlag.