ON THE REPETITIVITY INDEX OF INFINITE WORDS

DOI10.1142/S0218196709004968zbMath1187.68359MaRDI QIDQ3636020

Valerio D'Alonzo, Arturo Carpi

Publication date: 30 June 2009

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

zbMATH Keywords

critical exponentThue-Morse wordsynchronized sequencesmooth wordrepetitivity index

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (7)

How to prove that a sequence is not automatic ⋮ Synchronized sequences ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Automata and differentiable words ⋮ Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS

Cites Work

• Unnamed Item
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• The ring of \(k\)-regular sequences
• On repeated factors in \(C^\infty\)-words
• On Dejean's conjecture over large alphabets
• Sur un théorème de Thue
• A generalization of repetition threshold
• Unending chess, symbolic dynamics and a problem in semi-groups
• On synchronized sequences and their separators
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Repetitions in the Fibonacci infinite word
• Uniform tag sequences
• Symbolic Dynamics

This page was built for publication: ON THE REPETITIVITY INDEX OF INFINITE WORDS