Extremal infinite overlap-free binary words.
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pascal Ochem (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
We present an algorithm which produces, in some cases, infinite words avoiding both large fractional repetitions and a given set of finite words. We use this method to show that all the ternary patterns whose avoidability index was left open in Cassaigne's thesis are 2-avoidable. We also prove that there exist exponentially many -free ternary words and -free 4-ary words. Finally we give small morphisms for binary words containing only the squares , 1 and (01)² and for binary words...
Arturo Carpi, Aldo de Luca (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
For any finite word on a finite alphabet, we consider the basic parameters and of defined as follows: is the minimal natural number for which has no right special factor of length and is the minimal natural number for which has no repeated suffix of length . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words of each length on a fixed alphabet.
Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is well-known that some of the most basic properties of words, like the commutativity () and the conjugacy (), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution. For instance, the equation has only periodic solutions in a free monoid, that is, if holds with integers , then there exists a word such that are powers of . This result, which received a lot of attention, was first proved...
Currie, James, Rampersad, Narad, Shallit, Jeffrey (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Aberkane, Ali, Currie, James D. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: