arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.0888cs.FL
收藏

自由非周期半群的McCammond范式

McCammond's normal forms for free aperiodic semigroups revisited

Jorge Almeida, José Carlos Costa, Marc Zeitoun

摘要:

本文重新讨论了J. McCammond关于有限非周期半群上解释的$ω$ -项的字问题的解。原来的证明正确性的McCammond的算法,基于范式等条款,使用McCammond的解决方案的字问题的某些伯恩赛德半群。本文利用正则语言的范式的性质,建立了McCammond算法的一个新的、更简单的正确性证明。这种方法带来了新的应用。

英文摘要:

This paper revisits the solution of the word problem for $ω$-terms interpreted over finite aperiodic semigroups, obtained by J. McCammond. The original proof of correctness of McCammond's algorithm, based on normal forms for such terms, uses McCammond's solution of the word problem for certain Burnside semigroups. In this paper, we establish a new, simpler, correctness proof of McCammond's algorithm, based on properties of certain regular languages associated with the normal forms. This method leads to new applications.

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

↑