Undecidable Properties on Length-Two String Rewriting Systems

Length-two string rewriting systems are length-preserving string rewriting systems that consist of length-two rules. This paper shows that confluence, termination, left-most termination and right-most termination are undecidable properties for length-two string rewriting systems. These results mean that these properties are undecidable for the class of linear term rewriting systems in which depth-two variables are allowed in both sides of rules.

[1]  Enno Ohlebusch,et al.  Relative undecidability in term rewriting: II. the confluence hierarchy , 2002 .

[2]  Florent Jacquemard,et al.  Reachability and confluence are undecidable for flat term rewriting systems , 2003, Inf. Process. Lett..

[3]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[4]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[5]  Enno Ohlebusch,et al.  Relative undecidability in term rewriting: I. the termination Hierarchy , 2002 .

[6]  A. Geser.  Relative Undecidability in Term Rewriting Part 2 : The Confluence Hierarchy , 2002 .

[7]  Ashish Tiwari,et al.  Confluence of Shallow Right-Linear Rewrite Systems , 2005, CSL.

[8]  Enno Ohlebusch,et al.  Relative Undecidability in Term Rewriting: I. The Termination Hierarchy , 1996, Inf. Comput..

[9]  Yi Wang,et al.  Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems , 2006, RTA.

[10]  Nachum Dershowitz.  Termination of Linear Rewriting Systems (Preliminary Version) , 1981, ICALP.

[11]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[12]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[13]  Michio Oyamaguchi,et al.  The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable , 1987, Theor. Comput. Sci..

[14]  Gérard Huet,et al.  On the Uniform Halting Problem for Term Rewriting Systems , 1978 .

[15]  Ashish Tiwari,et al.  On the Confluence of Linear Shallow Term Rewrite Systems , 2003, STACS.

[16]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[17]  Ashish Tiwari,et al.  Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules , 2005, CADE.

[18]  Florent Jacquemard,et al.  The Confluence Problem for Flat TRSs , 2006, AISC.

[19]  Max Dauchet,et al.  Simulation of Turing Machines by a Regular Rewrite Rule , 1992, Theor. Comput. Sci..

[20]  Yuri V. Matiyasevich,et al.  Decision problems for semi-Thue systems with a few rules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[21]  Anne-Cécile Caron,et al.  Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties , 1991, TAPSOFT, Vol.1.