The recognizability problem for tree automata with comparisons between brothers

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

Volumn 1578, Issue , 1999, Pages 150-164

  Bogaert, Bruno ^a   Seynhaeve, Franck ^a   Tison, Sophie ^a  

^a UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

DECISION PROCEDURE; RECOGNIZABLE TREE LANGUAGES; SUBTERMS; TERM REWRITING; TREE AUTOMATA;

FORESTRY;

ALGORITHMS; PROBLEM SOLVING;

EID: 84937714416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_11     Document Type: Conference Paper

References (15)

1. A. Arnold. Le théoréme de transversale rationnelle dans les arbres. Mathematical System Theory, 13:275-282, 1980.
2. B. Bogaert, F. Seynhaeve, and S. Tison. The recognizability problem for tree automata with comparisons between brothers. Technical Report IT. 317, Laboratoire d'Informatique Fondamentale de Lille, Nov. 1998.
3. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, 9th Annual Symposium on Theoretical Aspects of Computer Science, volume 577 of Lecture Notes in Computer Science, pages 161-171, 1992.
4. A. Caron, H. Comon, J. Coquid_e, M. Dauchet, and F. Jacquemard. Pumping, cleaning and symbolic constraints solving. In Proceedings, International Colloquium Automata Languages and Programming, volume 820 of Lecture Notes in Computer Science, pages 436-449, 1994.
5. A. Caron, J. Coquid_e, and M. Dauchet. Encompassment properties and automata with constraints. In C. Kirchner, editor, Proceedings. Fifth International Conference on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 328-342, 1993.
6. H. Comon, M. Dauchet, R. Gilleron, S. Tison, and M. Tommasi. Tree automata techniques and applications, 1998. available through WWW from http://l3ux02.univ-lille3.fr/tata.
7. M. Dauchet, A.-C. Caron, and J.-L. Coquid_e. Reduction properties and automata with constraints. Journal of Symbolic Computation, 20:215-233, 1995.
8. M. Dauchet and S. Tison. Réduction de la non-linéarite des morphismes d'arbres. Technical Report IT-196, Laboratoire d'Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, 1990.
9. F. G_ecseg and M. Steinby. Tree Automata. Akademiai Kiado, 1984.
10. T. Genet. Decidable approximations of sets of descendants and sets of normal forms. volume 1379 of Lecture Notes in Computer Science, pages 151-165, Tsukuba, 1998.
11. J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in theories without constructors. Information and Computation, 82(1):1-33, July 1989.
12. G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. In Proceedings of 3rd International Workshop on Conditional Rewriting Systems, pages 150-156, 1992.
13. J. Mongy. Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. PhD thesis, Laboratoire d'Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, 1981.
14. 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, Oct. 1992.
15. J. Waldmann. Normalization of s-terms is decidable. volume 1379 of Lecture Notes in Computer Science, pages 138-150, Tsukuba, 1998.