Words with unbounded periodicity complexity

DOI10.1142/S0218196714500362zbMath1302.68225arXiv1306.3123OpenAlexW3101580307MaRDI QIDQ2934268

Štěpán Holub

Publication date: 12 December 2014

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3123

zbMATH Keywords

combinatorics on wordsperiodicity complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Toeplitz words, generalized periodicity and periodically iterated morphisms
• A characterization of substitutive sequences using return words
• Complexity of Toeplitz sequences
• A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
• Two-way string-matching

This page was built for publication: Words with unbounded periodicity complexity