Parallel Word Substitution

We study the parallel word substitution operation: in a text t, all non overlapping occurrences of a word ω are simultaneously substituted in each possible decomposition of t with respect to ω. We give necessary conditions on the reversibility of t under parallel word substitution.

[1]  Lila Kari,et al.  On Insertion and Deletion in Formal Languages , 1991 .

[2]  Gheorghe Paun,et al.  Deletion Sets , 1993, Fundam. Informaticae.

[3]  Victor Mitrana,et al.  Substitution on Words and Languages , 1993, Developments in Language Theory.

[4]  Lila Kari,et al.  Insertion and Deletion of Words: Determinism and Reversibility , 1992, MFCS.

[5]  Gheorghe Paun,et al.  On Parallel Deletions Applied to a Word , 1995, RAIRO Theor. Informatics Appl..

[6]  Victor Mitrana,et al.  Parallel Substitution on Words and Languages , 1993, Sci. Ann. Cuza Univ..

[7]  J. Howie.  COMBINATORICS ON WORDS (Encyclopedia of Mathematics and Its Applications, 17) , 1984 .