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 the orbit of the Fibonacci word.
منابع مشابه
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 ...
متن کاملSmooth words on 2-letter alphabets having same parity
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that the closure of the set of factors under reversal holds for odd alphabets only. We provide a linear time algorithm computing the extremal words, w.r.t. lexicographic order. The minimal word is an infinite Lyndon word if and on...
متن کاملQuasi-Gap and Gap Functions for Non-Smooth Multi-Objective Semi-Infinite Optimization Problems
In this paper, we introduce and study some new single-valued gap functions for non-differentiable semi-infinite multiobjective optimization problems with locally Lipschitz data. Since one of the fundamental properties of gap function for optimization problems is its abilities in characterizing the solutions of the problem in question, then the essential properties of the newly introduced ...
متن کامل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.
متن کاملDistributing Labels on Infinite Trees
Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the labels 0 and 1 are as evenly distributed as possible) and they can be constructed using a mechanical definition. All this properties make them good candidates for being extremal points in scheduling problems over two pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2007