ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD

DOI10.17654/DM025020143zbMATH Open1499.68294OpenAlexW3109638750WikidataQ114049295 ScholiaQ114049295MaRDI QIDQ5075611

Boucaré Kientéga, Idrissa Kaboré, K. Ernest Bognini

Publication date: 16 May 2022

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/dm025020143

zbMATH Keywords

factorizationinfinite wordpalindromesubstitutionperiod-doubling word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On z-factorization and c-factorization of standard episturmian words
• An optimal algorithm for computing the repetitions in a word
• Infinite Lyndon words
• Squares, cubes, and time-space efficient string searching
• Local symmetries in the period-doubling sequence
• Nyldon words
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Automatic Sequences
• Crochemore Factorization of Sturmian and Other Infinite Words
• Free differential calculus. IV: The quotient groups of the lower central series

Related Items (1)

Unnamed Item

This page was built for publication: ZIV-LEMPEL AND CROCHEMORE FACTORIZATIONS OF THE GENERALIZED PERIOD-DOUBLING WORD