Decision Problems for Term Rewriting Systems and Recognizable Tree Languages

We study the connections between recognizable tree languages and rewrite systems. We investigate some decision problems. Particularly, let us consider the property (P): a rewrite system S is such that, for every recognizable tree language F, the set of S-normal forms of terms in F is recognizable too. We prove that the property (P) is undecidable. We prove that the existential fragment of the theory of ground term algebras modulo a congruence \(\mathop \leftrightarrow \limits^* E\) generated by a set E of equations such that there exists a finite, noetherian, confluent rewrite system S satisfying (P) with \(\mathop \leftrightarrow \limits^* S = \mathop \leftrightarrow \limits^* E\) is undecidable. Nevertheless, we develop a decision procedure for the validity of linear formulas in a fiagment of such a theory.

[1]  Ronald V. Book.  Thue Systems as Rewriting Systems , 1987, J. Symb. Comput..

[2]  Matthias Jantzen,et al.  Confluent String Rewriting , 1988, EATCS Monographs on Theoretical Computer Science.

[3]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[4]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[5]  Sándor Vágvölgyi,et al.  A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata , 1988, ALP.

[6]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[7]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Ronald V. Book.  Decidable Sentences of Church-Rosser Congruences , 1983, Theor. Comput. Sci..

[9]  Jean H. Gallier,et al.  Reductions in Tree Replacement Systems , 1985, Theor. Comput. Sci..

[10]  Kai Salomaa,et al.  Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems , 1988, J. Comput. Syst. Sci..

[11]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[12]  Max Dauchet.  Simulation of Turning Machines by a Left-Linear Rewrite Rule , 1989, RTA.

[13]  Rémi Gilleron,et al.  Proofs and Reachablity Problem for Ground Rewrite Systems , 1990, IMYCS.

[14]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata and Rewrite Systems , 1991, RTA.

[15]  B. Courcelle.  On Recognizable Sets and Tree Automata , 1989 .

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

[17]  Sophie Tison,et al.  About Connections Between Syntactical and Computational Complexity , 1989, FCT.

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