On One-Rule Grid Semi-Thue Systems

The family of one-rule grid semi-Thue systems, introduced by Alfons Geser, is the family of one-rule semi-Thue systems such that there exists a letter c that occurs as often in the left-hand side as the right-hand side of the rewriting rule. We prove that for any one-rule grid semi-Thue system S, the set S(w) of all words obtainable from w using repeatedly the rewriting rule of S is a constructible context-free language. We also prove the regularity of the set Loop(S) of all words that start a loop in a one-rule grid semi-Thue systems S.

[1]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[2]  Yi Wang,et al.  Undecidable Properties on Length-Two String Rewriting Systems , 2007, WRS@RDP.

[3]  Hans Zantema,et al.  A Complete Characterization of Termination of 0p 1q→ 1r 0s , 2000, Applicable Algebra in Engineering, Communication and Computing.

[4]  Alfons Geser,et al.  Termination of String Rewriting Rules That Have One Pair of Overlaps , 2003, RTA.

[5]  Géraud Sénizergues.  Some Undecidable Termination Problems for Semi-Thue Systems , 1995, Theor. Comput. Sci..

[6]  Alfons Geser,et al.  Loops of Superexponential Lengths in One-Rule String Rewriting , 2002, RTA.

[7]  Yuri V. Matiyasevich,et al.  Decision problems for semi-Thue systems with a few rules , 2005, Theor. Comput. Sci..

[8]  Celia Wrathall.  Confluence of One-Rule Thue Systems , 1990, IWWERT.

[9]  Alfons Geser,et al.  Termination of Single-Threaded One-Rule Semi-Thue Systems , 2005, RTA.

[10]  Yi Wang,et al.  Confluence of Length Preserving String Rewriting Systems is Undecidable , 2007 .

[11]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

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

[13]  Alfons Geser,et al.  Decidability of Termination of Grid String Rewriting Rules , 2002, SIAM J. Comput..

[14]  Robert McNaughton.  Well behaved derivations in one-rule semi-Thue systems , 1995 .

[15]  Hans Zantema,et al.  Non-looping string rewriting , 1999, RAIRO Theor. Informatics Appl..

[16]  Deepak Kapur,et al.  On Proving Uniform Termination and Restricted Termination of Rewriting Systems , 1983, SIAM J. Comput..

[17]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[18]  Winfried Kurth.  One-Rule Semi-Thue Systems with Loops of Length One, Two or Three , 1996, RAIRO Theor. Informatics Appl..

[19]  Max Dauchet,et al.  Termination of Rewriting is Undecidable in the One-Rule Case , 1988, MFCS.

[20]  Robert McNaughton.  Semi-Thue Systems with an Inhibitor , 2004, Journal of Automated Reasoning.

[21]  Géraud Sénizergues.  On the Termination Problem for One-Rule Semi-Thue System , 1996, RTA.