Crochemore Factorization of Sturmian and Other Infinite Words
From MaRDI portal
(Redirected from Crochemore Factorization of Sturmian and Other Infinite Words)
Recommendations
- On the number of factors of Sturmian words
- Viennot factorization of infinite words
- Combinatorial structure of Sturmian words and continued fraction expansion of Sturmian numbers
- Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words
- Variety and multiplicity for partitioned factors in Christoffel and Sturmian words
- On stabilizers of infinite words
- Special factors, periodicity, and an application to Sturmian words
- On repeated factors in \(C^\infty\)-words
Cited in
(14)- Repetitions in strings: algorithms and combinatorics
- Computing the longest previous factor
- Computing longest previous non-overlapping factors
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words
- On the approximation ratio of LZ-end to LZ77
- Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words
- Crochemore sets
- Arithmetics on suffix arrays of Fibonacci words
- Greedy palindromic lengths
- Ziv-Lempel and Crochemore factorizations of the generalized period-doubling word
- On the palindromic zl-factorization and c-factorization of the generalized period-doubling sequences
- Queer supercrystal structure for increasing factorizations of fixed-point-free involution words
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
- On z-factorization and c-factorization of standard episturmian words
This page was built for publication: Crochemore Factorization of Sturmian and Other Infinite Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756692)
