Name
Abstract | ||
|---|---|---|
Thue proved that the factors occurring infinitely many times in square-free words over { 0 , 1 , 2 } avoiding the factors in { 010 , 212 } are the factors of the fixed point of the morphism 0 ¿ 012 , 1 ¿ 02 , 2 ¿ 1 . He similarly characterized square-free words avoiding { 010 , 020 } and { 121 , 212 } as the factors of two morphic words. In this paper, we exhibit smaller morphisms to define these two square-free morphic words and we give such characterizations for six types of binary words containing few distinct squares. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.tcs.2015.03.044 | Theoretical Computer Science |
Keywords | Field | DocType |
Combinatorial problems,Repetitions,Avoidability | Discrete mathematics,Combinatorics,Fixed point,Morphism,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
588 | C | 0304-3975 |
Citations | PageRank | References |
1 | 0.41 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Golnaz Badkobeh | 1 | 95 | 14.12 |
| Pascal Ochem | 2 | 258 | 36.91 |