Characterization of Test-sets for Overlap-free Morphisms

نویسندگان

  • Gwénaël Richomme
  • Patrice Séébold
چکیده

We give a characterization of all the sets X such that any morphism h on fa; bg is overlap-free ii for all x in X , h(x) is overlap-free. As a consequence, we observe the particular case X = fbbabaag which improves the previous characterization of Berstel-S e ebold 2]. R esum e Nous donnons une caract erisation de tous les ensembles X tels qu'un morphisme h sur fa; bg est sans chevauchement si et seulement si, pour tout x dans X , h(x) est sans chevauchement. En particulier, on prouve que h est un morphisme sans chevauchement si et seulement si h(bbabaa) est sans chevauchement, ce qui am eliore un r esultat pr ec edemment prouv e par Berstel-S e ebold 2]. De plus, ce r esultat est optimal. 1 Notations and Deenitions Let A be a nite alphabet, and A the free monoid generated by A. We denote by " the empty word. A word u is a subword or factor of a word v if there exist some words x and y (possibly empty) such that v = xuy. We denote by Fact(X) the set of all the subwords of words of X. A word on an alphabet A is overlap-free if it has no subword of the form xuxux for some word u and some non empty word x (or some letter x). Remark that a word u is overlap-free ii its mirror image ~ u is overlap-free. An overlap-free morphism h on A is a morphism such that for any overlap-free word x, h(x) is overlap-free. A morphism on A is erasing if for at least one letter a in A, h(a) = ". Note that an erasing morphism can never be overlap-free. From here, we restrict our attention on binary alphabet A = fa; bg. The basic overlap-free morphisms on A are the identity Id, the morphism E which exchanges a and b, and the morphism such that (a) = ab and (b) = ba. Clearly, the composition of two overlap-free morphisms is overlap-free. Thus for any integer k, k and E k are overlap-free. The converse was proved by Thue 4] (see also 1, 5]): Theorem 1 A morphism h on fa; bg is overlap-free ii h = k or h = E k for some integer k 0. In this note, we will characterize all the test-sets for the overlap-freeness of morphism …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Morphisms With Unstackable Image Words

In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the Leech square-free morphism to gain insights on a larger class of both overlap-free morphisms and square-free morphisms.

متن کامل

Existence of finite test-sets for k-power-freeness of uniform morphisms

A challenging problem is to find an algorithm to decide whether a morphism is k-power-free. We provide such an algorithm when k ≥ 3 for uniform morphisms showing that in such a case, contrarily to the general case, there exist finite test-sets for k-power-freeness.

متن کامل

Characteristic morphisms of generalized episturmian words

In a recent paper with L. Q. Zamboni, the authors introduced the class of θ-episturmian words. An infinite word over A is standard θepisturmian, where θ is an involutory antimorphism of A∗, if its set of factors is closed under θ and its left special factors are prefixes. When θ is the reversal operator, one obtains the usual standard episturmian words. In this paper, we introduce and study θ-c...

متن کامل

A Characterization of Overlap-Free Morphisms

We prove that a morphism h over a two-letter alphabet {a, b} is overlap-free, i.e., maps overlap-free words into overlap-free words, iff the word h(abbabaab) is overlap-free. As a consequence, we obtain a simple proof of the fact that the only infinite overlap-free words that can be obtained by iterating a morphism are the Thue-Morse sequence and its opposite. RLsumP Nous prouvons qu’un morphis...

متن کامل

A Rewriting of Fife's Theorem about Overlap-Free Words

I n t r o d u c t i o n One of the first results about avoidable regularities in words was Axel Thue's proof of the existence of an infinite overlap-free words over two letters. In two important papers [16, 17], Thue derived a great number of results in this and related topics. His papers were overseen for a long time (see [6] for a discussion) and his results have been rediscovered several tim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 98  شماره 

صفحات  -

تاریخ انتشار 1999