A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY

DOI10.1142/S0218196713400080zbMath1269.68077MaRDI QIDQ2842028

Filippo Mignosi, Antonio Restivo

Publication date: 30 July 2013

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

zbMATH Keywords

periodicitycombinatorics on wordscomplexity functionscritical factorization theorem

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Cyclic Complexity of Words ⋮ Words with unbounded periodicity complexity ⋮ Unnamed Item ⋮ Sequences of words defined by two-way transducers ⋮ On the Lie complexity of Sturmian words

Cites Work

• Unnamed Item
• Unnamed Item
• Characteristic Sturmian words are extremal for the critical factorization theorem
• On the number of frames in binary words
• Periodes et repetitions des mots du monoide libre
• Some combinatorial properties of Sturmian words
• Automatic Sequences

This page was built for publication: A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY