A test-set for $k$-power-free binary morphisms

F. Wlazinski

Displaying similar documents to “A test-set for $k$ -power-free binary morphisms”

Extremal infinite overlap-free binary words.

Allouche, Jean-Paul, Currie, James, Shallit, Jeffrey (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A generator of morphisms for infinite words

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 ${\frac{7}{4}}^{+}$ -free ternary words and ${\frac{7}{5}}^{+}$ -free 4-ary words. Finally we give small morphisms for binary words containing only the squares , 1 and (01)² and for binary words...

On the distribution of characteristic parameters of words

Arturo Carpi, Aldo de Luca (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

For any finite word $w$ on a finite alphabet, we consider the basic parameters $R_{w}$ and $K_{w}$ of $w$ defined as follows: $R_{w}$ is the minimal natural number for which $w$ has no right special factor of length $R_{w}$ and $K_{w}$ is the minimal natural number for which $w$ has no repeated suffix of length $K_{w}$ . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words of each length on a fixed alphabet.

Equations on partial words

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 ( $x y = y x$ ) and the conjugacy ( $x z = z y$ ), 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 $x^{m} y^{n} = z^{p}$ has only periodic solutions in a free monoid, that is, if $x^{m} y^{n} = z^{p}$ holds with integers $m, n, p \geq 2$ , then there exists a word $w$ such that $x, y, z$ are powers of $w$ . This result, which received a lot of attention, was first proved...

Binary words containing infinitely many overlaps.

Currie, James, Rampersad, Narad, Shallit, Jeffrey (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

There exist binary circular $5 / 2^{+}$ power free words of every length.

Aberkane, Ali, Currie, James D. (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Displaying similar documents to “A test-set for k -power-free binary morphisms”

Extremal infinite overlap-free binary words.

A generator of morphisms for infinite words

On the distribution of characteristic parameters of words

Equations on partial words

Binary words containing infinitely many overlaps.

There exist binary circular 5 / 2 + power free words of every length.

Displaying similar documents to “A test-set for $k$ -power-free binary morphisms”

There exist binary circular $5 / 2^{+}$ power free words of every length.