Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Finite test sets for morphisms which are square-free on some of Thue's square-free ternary words (1902.05651v1)

Published 15 Feb 2019 in cs.FL

Abstract: Let $S$ be one of ${aba,bcb}$ and ${aba, aca}$, and let $w$ be an infinite square-free word over $\Sigma={a,b,c}$ with no factor in $S$. Suppose that $f:\Sigma\rightarrow 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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.