Infinite Smooth Lyndon Words
نویسنده
چکیده
Motivation Outline Notation Lyndon words Smooth words Result Idea of the proof Case a) Case b) Case c) Case d) Open problems Motivation ◮ Lyndon words : class of words having lexicographical order properties. ◮ Smooth words : class of words, related to the Kolakoski word, that can be easily compressed. ◮ Some infinite smooth words are also Lyndon words.
منابع مشابه
A characterization of infinite smooth Lyndon words
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only ones? If no, what do the infinite smooth words that are also Lyndon words look like? In this paper, we give the answer, proving that the only infinite smooth Lyndon words are m{a<b}, with a, b even, m{1<b} and ∆ −1 1 ...
متن کاملProperties of the Extremal Infinite Smooth Words
Smooth words are connected to the Kolakoski sequence. We construct the maximal and the minimal infinite smooth words, with respect to the lexicographical order. The naive algorithm generating them is improved by using a reduction of the De Bruijn graph of their factors. We also study their Lyndon factorizations. Finally, we show that the minimal smooth word over the alphabet {1, 3} belongs to t...
متن کاملLyndon factorization of the Thue-Morse word and its relatives
Some attention has recently been given to the Lyndon factorization of infinite words [16], [10], [12]. These works are themselves related to the earlier works by Reutenauer [13] and Varricchio [17], concerned with unavoidable regularities and semigroup theory. The results we present here reinforce those in [10] and [12], and give an additional application of the general Lyndon factorization the...
متن کاملLyndon words and Fibonacci numbers
It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound ⌈log 2 (n)⌉ + 1 for the number of distinct Lyndon factors that a Lyndon word of length n must have, but this bound is not optimal. In this paper we show that a much more accurate lower bound is ⌈logφ(n)⌉ + 1, where φ denotes the gol...
متن کاملCounting Lyndon Factors
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n can contain. We also derive formulas for the expected total number of Lyndon factors in a word of length n on an alphabet of size σ, as well as the expected number of distinct Lyndon factors in such a word. The minimum number of distinct Lyndon factors in a word of length n is 1 and the minimum tot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008