Infinite ternary square-free words concatenated from permutations of a single word
Formal Languages and Automata Theory
2012-07-23 v2 Combinatorics
Abstract
We answer a question of Harju: An infinite square-free ternary word with an -stem factorization exists for any . We show that there are uniform ternary morphisms of length for every . This resolves almost completely a problem of the author and Rampersad.
Cite
@article{arxiv.1207.3445,
title = {Infinite ternary square-free words concatenated from permutations of a single word},
author = {James D. Currie},
journal= {arXiv preprint arXiv:1207.3445},
year = {2012}
}