Recommendations
Cites work
Cited in
(29)- Lyndon words and singular factors of sturmian words
- Viennot factorization of infinite words
- Lyndon factorization of the Prouhet words.
- Anti-powers in infinite words
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words
- A characterization of binary morphisms generating Lyndon infinite words
- Reprint of: ``\(\omega\)-Lyndon words
- Reprint of: ``Generalized Lyndon factorizations of infinite words
- -Lyndon words
- Some properties of the Tribonacci sequence
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
- On generalized Lyndon words
- A coloring problem for infinite words
- Smooth words on 2-letter alphabets having same parity
- On the Lyndon dynamical system
- The \(\beta\)-transformation with a hole at 0
- Transfinite Lyndon words
- Look and Say Fibonacci
- Lyndon words and Fibonacci numbers
- Infinite self-shuffling words
- Generic Algorithms for Factoring Strings
- Ziv-Lempel and Crochemore factorizations of the generalized period-doubling word
- Transfinite Lyndon words
- Characterization of infinite LSP words and endomorphisms preserving the LSP property
- On morphisms preserving infinite {L}yndon words
- A characterization of infinite smooth Lyndon words
- On infinite prefix normal words
- Markoff-Lagrange spectrum of one-sided shifts
- Quasiperiodic Sturmian words and morphisms
This page was built for publication: Infinite Lyndon words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322121)
