Finite-Repetition threshold for infinite ternary words
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an a-letter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a). This notion was introduced in 1972 by Dejean who...
Main Authors: | Golnaz Badkobeh, Maxime Crochemore |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2011-08-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1108.3619v1 |
Similar Items
-
Avoiding redundancies in words
by: Badkobeh, Golnaz
Published: (2013) -
Infinite permutations vs. infinite words
by: Anna E. Frid
Published: (2011-08-01) -
About the Infinite Repetition of Histories in Space
by: Manuel Alfonseca, et al.
Published: (2014-08-01) -
Repetition in Words
by: Mousavi Haji, Seyyed Hamoon
Published: (2013) -
Repetition in Words
by: Mousavi Haji, Seyyed Hamoon
Published: (2013)