Encompassment Properties and Automata with Constraints

We introduce a class of tree automata with constraints which gives an algebraic and algorithmic framework in order to extend the theorem of decidability of inductive reducibility. We use automata with equality constraints in order to solve encompassment constraints and we combine such automata in order to solve every first order formulas built up with unary predicates “x encompasses t” denoted by encompt(x).

[1]  Jacques Sakarovitch,et al.  Synchronized Rational Relations of Finite and Infinite Words , 1993, Theor. Comput. Sci..

[2]  Jean-Pierre Jouannaud,et al.  Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.

[3]  Sophie Tison,et al.  Equality and Disequality Constraints on Direct Subterms in Tree Automata , 1992, STACS.

[4]  Hubert Comon.  Equational Formulas in Order-Sorted Algebras , 1990 .

[5]  H. Bedmann,et al.  Beiträge zur Algebra der Logik, insbesondere zum Entscheidungsproblem , 1922 .

[6]  H. Comon.  SOLVING SYMBOLIC ORDERING CONSTRAINTS , 1990 .

[7]  Hubert Comon-Lundh,et al.  Equational Problems and Disunification , 1989, J. Symb. Comput..

[8]  David A. Plaisted,et al.  Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..

[9]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[10]  Leopold Löwenheim.  Über Möglichkeiten im Relativkalkül , 1915 .

[11]  K. N. Venkataraman,et al.  Decidability of the purely existential fragment of the theory of term algebras , 1987, JACM.

[12]  Gregory Kucherov.  On Relationship Between Term Rewriting Systems and Regular Tree Languages , 1991, RTA.

[13]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[14]  Claude Kirchner,et al.  Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[15]  Ralf Treinen,et al.  A New Method for Undecidability Proofs of First Order Theories , 1990, FSTTCS.

[16]  Nachum Dershowitz,et al.  Computing with Rewrite Systems , 1985, Inf. Control..