Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words
Abstract
Let S be one of \aba,bcb\ and \aba, aca\, and let w be an infinite square-free word over =\a,b,c\ with no factor in S. Suppose that f:→ T* is a non-erasing morphism. Word f(w) is square-free if and only if f is square-free on factors of w of length 8 or less.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.