English

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 SS be one of {aba,bcb}\{aba,bcb\} and {aba,aca}\{aba, aca\}, and let ww be an infinite square-free word over Σ={a,b,c}\Sigma=\{a,b,c\} with no factor in SS. Suppose that f:ΣTf:\Sigma\rightarrow T^* is a non-erasing morphism. Word f(w)f(w) is square-free if and only if ff is square-free on factors of ww of length 8 or less.

Keywords

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}
}