| Autor: |
Carton, Olivier, Boasson, Luc |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Volume 16, Issue 4 (November 10, 2020) lmcs:4851 |
| Druh dokumentu: |
Working Paper |
| DOI: |
10.23638/LMCS-16(4:9)2020 |
| Popis: |
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. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
