Regular sets of descendants for constructor-based rewrite systems

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

Volumn 1705 LNAI, Issue , 1999, Pages 148-160

  Réty, Pierre ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

Author keywords

Term rewriting; Tree automata

Indexed keywords

FORESTRY; TREES (MATHEMATICS);

FINITE TREE AUTOMATON; NESTED FUNCTIONS; REGULAR TREE LANGUAGES; REWRITE SYSTEMS; RIGHT-HAND SIDES; TERM REWRITE SYSTEMS; TERM REWRITING; TREE AUTOMATA;

COMPUTER CIRCUITS;

EID: 22844455635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_10     Document Type: Conference Paper

References (13)

1. H. Comon. Sequentiality, second order monadic logic and tree automata. In Proc, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 508-517. IEEE Computer Society Press, 26-29 June 1995.
2. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications (TATA), http://13ux02.univ-lille3.fr/ tata.
3. Hubert Comon and Florent Jacquemard. Ground reducibility is exptime-complete. In Proc. IEEE Symp. on Logic in Computer Science, Varsaw, June 1997. IEEE Comp. Soc. Press.
4. J. Coquide, M. Dauchet, R. Gilleron, and S. Vagvolgyi. Bottom-up Tree Pushdown Automata and Rewrite Systems. In R. V. Book, editor. Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of LNCS, pages 287-298. Springer-Verlag, April 1991.
5. M. Dauchet ad S. Tison. The theory of ground rewrite systems is decidable. In Proc, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 242-248, Philadelphia, Pennsylvania, 1990. IEEE Computer Society Press.
6. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. Van Leuven, editor. Handbook of Theoretical Computer Science, chapter 6, pages 243-320. Elsevier Science Publishers, 1990.
7. T. Genet. Decidable Approximations of Sets of Descendants and Sets of Normal Forms. In Proceedings of 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japan), volume 1379 of LNCS, pages 151-165. Springer-Verlag, 1998.
8. R. Gilleron and S. Tison. Regular Tree Languages and Rewrite Systems. fundamenta Informaticae, 24:157-175, 1995.
9. F. Jacquemard. Decidable Approximations of Term Rewrite Systems. In H. Ganzinger, editor. Proceedings 7th Conference RTA, New Brunswick (USA), volume 1103 of LNCS, pages 362-376. Springer-Verlag, 1996.
10. S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 429-440. Springer-Verlag, 1997.
11. S. Limet and P. Rety. El-Unification by Means of Tree Tuple Synchronized Grammars. Discrete Mathematics and Theoritical Computer Science, 1:69-98, 1997. (http://dmtcs.loria.fr/).
12. P. Réty. Méthodes d'Unification par Surréduction. Thèse de Doctorat d'Université, Université de Nancy I, March 1988. In french.
13. K. Salomaa. Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. The Journal of Computer and System Sciences, 37:367-394, 1988.