On the growth rates of complexity of threshold languages

Arseny M. Shur, Irina A. Gorbunova
2010 RAIRO - Theoretical Informatics and Applications  
Threshold languages, which are the (k/(k−1)) + -free languages over k-letter alphabets with k ≥ 5, are the minimal infinite power-free languages according to Dejean's conjecture, which is now proved for all alphabets. We study the growth properties of these languages. On the base of obtained structural properties and computerassisted studies we conjecture that the growth rate of complexity of the threshold language over k letters tends to a constantα ≈ 1.242 as k tends to infinity. Mathematics
more » ... inity. Mathematics Subject Classification. 68Q70, 68R15.
doi:10.1051/ita/2010012 fatcat:6jhxdhlu3rgq5fxxgtkm773gwq