Counting ternary square-free words quickly
英文摘要：
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
