The following pages link to Infinite Lyndon words (Q1322121):
Displayed 24 items.
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- Infinite self-shuffling words (Q458277) (← links)
- Quasiperiodic Sturmian words and morphisms (Q870835) (← links)
- Lyndon words and singular factors of sturmian words (Q1292480) (← links)
- Viennot factorization of infinite words (Q1350922) (← links)
- Lyndon factorization of the Prouhet words. (Q1426044) (← links)
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words (Q2136272) (← links)
- A characterization of binary morphisms generating Lyndon infinite words (Q2140469) (← links)
- Reprint of: ``\(\omega\)-Lyndon words'' (Q2192372) (← links)
- Reprint of: ``Generalized Lyndon factorizations of infinite words'' (Q2192374) (← links)
- \( \omega \)-Lyndon words (Q2290620) (← links)
- Some properties of the Tribonacci sequence (Q2372431) (← links)
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words (Q2373762) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- A coloring problem for infinite words (Q2451905) (← links)
- Smooth words on 2-letter alphabets having same parity (Q2481962) (← links)
- The -transformation with a hole at 0 (Q3303948) (← links)
- Transfinite Lyndon Words (Q3451100) (← links)
- Look and Say Fibonacci (Q3537494) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD (Q5075611) (← links)
- (Q5140264) (← links)
- On infinite prefix normal words (Q5919082) (← links)
- Generalized Lyndon factorizations of infinite words (Q5919346) (← links)