Cyclic Complexity of Words

DOI10.1007/978-3-662-44522-8_14zbMath1425.68326arXiv1402.5843OpenAlexW2951112613MaRDI QIDQ2922011

Julien Cassaigne, Marinella Sciortino, Luca Q. Zamboni, Gabriele Fici

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

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

zbMATH Keywords

Sturmian wordsfactor complexitycyclic complexityminimal forbidden factor

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Words with the Maximum Number of Abelian Squares ⋮ On the additive complexity of a Thue-Morse-like sequence ⋮ Cyclic complexity of words

Cites Work

• Unnamed Item
• Unnamed Item
• On a generalization of abelian equivalence and complexity of infinite words
• Substitutions in dynamics, arithmetics and combinatorics
• Burrows-Wheeler transform and Sturmian words
• Words and forbidden factors
• Characterisations of balanced words via orderings
• Abelian complexity and abelian co-decomposition
• The abelian complexity of the paperfolding word
• A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
• Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Abelian complexity of minimal subshifts
• On Christoffel classes
• Sturmian and Episturmian Words
• Combinatorics on Words
• Maximal pattern complexity for discrete systems
• On the Asymptotic Abelian Complexity of Morphic Words

This page was built for publication: Cyclic Complexity of Words