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

超限Lyndon词

Transfinite Lyndon words

Olivier Carton, Luc Boasson

AI总结:

本文将Lyndon词推广至超限词,证明其存在唯一稠密非递增Lyndon词分解,并给出有理词分解的特殊形式及计算方法。

摘要:

本文我们将Lyndon词的概念扩展到超限词。我们证明两个主要结果。首先,给定一个超限词,存在一个唯一的分解为稠密非递增的Lyndon词,这是有限词情形中所用条件的一种放宽。在附录中,我们证明有理词的分解具有特殊形式,并且可以从描述该词的有理表达式中计算得出。

英文摘要:

In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a relaxation of the condition used in the case of finite words. In the annex, we prove that the factorization of a rational word has a special form and that it can be computed from a rational expression describing the word.

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

↑