𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Viennot factorization of infinite words

✍ Scribed by Guy Melançon

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
462 KB
Volume
60
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

Example 3. Let A be totally ordered by <. One may extend this order lexicographically to the whole set 2 This is the name Lothaire gives them [ 41. Viennot [ 121 modestly calls them regular.

📜 SIMILAR VOLUMES

Lyndon factorization of the Prouhet word
Lyndon factorization of the Prouhet words
✍ Patrice Séébold 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Prouhet words are a natural generalization, over alphabets with more than two letters, of the well known binary Thue-Morse word. We give a unique factorization of these words in a sequence of decreasing Lyndon words, then generalizing such a decomposition given by Ido and Melan con for the Thue-Mor

On some factorizations of infinite words
On some factorizations of infinite words by elements of codes
✍ J. Justin; G. Pirillo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 621 KB

We show that an infinite word s satisfies s = uoutu2 . . . with all ui being different nonempty words and their set being a biprefix code if and only if s is not ultimately periodic. We give also related results, considering in particular arbitrary codes, infix codes and the case of two-sided infini