Crochemore Factorization of Sturmian and Other Infinite Words

DOI10.1007/11821069_14zbMath1132.68512OpenAlexW1516642275MaRDI QIDQ5756692

Jean Berstel, A. Savelli

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (11)

Closed Ziv-Lempel factorization of the \(m\)-bonacci words ⋮ Arithmetics on Suffix Arrays of Fibonacci Words ⋮ On the approximation ratio of LZ-end to LZ77 ⋮ ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD ⋮ Computing longest previous non-overlapping factors ⋮ Greedy Palindromic Lengths ⋮ Computing the longest previous factor ⋮ Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words ⋮ On z-factorization and c-factorization of standard episturmian words ⋮ Unnamed Item ⋮ Repetitions in strings: algorithms and combinatorics

This page was built for publication: Crochemore Factorization of Sturmian and Other Infinite Words