A canonical automaton for one-rule length-preserving string rewrite systems

In this work, we use rearrangements in rewriting positions sequence in order to study precisely the structure of the derivations in one-rule length-preserving string rewrite systems. That yields to the definition of a letter-to-letter transducer that computes the relation induced by a one-rule length-preserving string rewrite system. This transducer can be seen as an automaton over an alphabet A × A . We prove that this automaton is finite if and only if the corresponding relation is rational. We also identify a sufficient condition for the context-freeness of the language L recognized by this automaton and, when this condition is satisfied, we construct a pushdown automaton that recognizes L.

[1]  David Simplot-Ryl,et al.  Iteration of rational transductions , 2000, RAIRO Theor. Informatics Appl..

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

[3]  Nachum Dershowitz,et al.  Open. Closed. Open , 2005, RTA.

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

[5]  Juhani Karhumäki,et al.  On cube-free ω-words generated by binary morphisms , 1983, Discret. Appl. Math..

[6]  M. Clerbout,et al.  Semi-commutations , 1987, Inf. Comput..

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

[8]  Mireille Clerbout,et al.  Semicommutations and Algebraic Languages , 1992, Theor. Comput. Sci..

[9]  Michel Latteux,et al.  One-Rule Length-Preserving Rewrite Systems and Rational Transductions , 2014, RAIRO Theor. Informatics Appl..

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

[11]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[12]  Véronique Bruyère,et al.  Automata and Codes with Bounded Deciphering Delay , 1992, LATIN.

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

[14]  Bala Ravikumar,et al.  Peg-solitaire, string rewriting systems and finite automata , 1997, Theor. Comput. Sci..

[15]  Masashi Katsura,et al.  Termination and derivational complexity of confluent one-rule string-rewriting systems , 2001, Theor. Comput. Sci..

[16]  Yves Métivier,et al.  On Lexicographic Semi-Commutations , 1987, Inf. Process. Lett..

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

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