arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.3932cs.FL
收藏

法伊夫定理的再认识

Fife's Theorem Revisited

Jeffrey Shallit

摘要:

我们给出了另一个证明的一个定理的法夫-广义理解为提供一个有限自动机,给出了一个完整的描述所有无限二进制的自由字。我们的证明比文献中的证明简单得多。作为一个应用,我们给出了2-自动的无歧义词的一个完整的刻画。

英文摘要:

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As an application we give a complete characterization of the overlap-free words that are 2-automatic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑