Encompassment properties and automata with constraints-Reference-Cited by-同舟云学术

Encompassment properties and automata with constraints

Published:1993 Issue: Volume: Page:328-342
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Caron Anne-Cécile,Coquide Jean-Luc,Dauchet Max

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56868-9_25.pdf

Reference24 articles.

1. H. Behmann. Beitrage zur algebra der logik, insbesondere zum entscheidungsproblem. Mathematische Annalen, 86:163–229, 1922.

2. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Lecture Notes in Computer Science Vol 577, pages 161–171. Symposium on theoretical aspects of computer science, 1992.

3. A.C. Caron. Structures et Décision en Réécriture. PhD thesis, Laboratoire d'Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, February 1993.

4. H. Comon. Equational formulas on order-sorted algebras. In Proceedings of ICALP'90, pages 674–688, 1990.

5. H. Comon. Solving symbolic ordering constraints. International Journal on Foundations of Computer Science, 1(4), 1990.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus;Theory of Security and Applications;2012

2. Bottom-Up Tree Automata with Term Constraints;Logic for Programming, Artificial Intelligence, and Reasoning;2010

3. Twenty Years Later;Lecture Notes in Computer Science;2005

4. Réduction de la non-linéarité des morphismes d'arbres Recognizable tree-languages and non-linear morphisms;Theoretical Computer Science;2002-06

5. Constraint Solving on Terms;Constraints in Computational Logics;2001