Crochemore Factorization of Sturmian and Other Infinite Words
From MaRDI portal
Publication:5756692
DOI10.1007/11821069_14zbMath1132.68512MaRDI QIDQ5756692
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_14
68R15: Combinatorics on words
Related Items
Greedy Palindromic Lengths, Unnamed Item, ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD, On z-factorization and c-factorization of standard episturmian words, 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, Arithmetics on Suffix Arrays of Fibonacci Words