Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words
Formal Languages and Automata Theory
2019-02-18 v1
Abstract
Let be one of and , and let be an infinite square-free word over with no factor in . Suppose that is a non-erasing morphism. Word is square-free if and only if is square-free on factors of of length 8 or less.
Cite
@article{arxiv.1902.05651,
title = {Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words},
author = {James D. Currie},
journal= {arXiv preprint arXiv:1902.05651},
year = {2019}
}