RAIRO-Theor. Inf. Appl.
Volume 44, Number 1, January-March 2010Special issue dedicated to the 12th "Journées Montoises d'Informatique Théorique"
|Page(s)||175 - 192|
|Published online||11 February 2010|
On the growth rates of complexity of threshold languages
Ural State University, Ekaterinburg, Russia; Arseny.Shur@usu.ru
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 computer-assisted studies we conjecture that the growth rate of complexity of the threshold language over k letters tends to a constant as k tends to infinity.
Mathematics Subject Classification: 68Q70 / 68R15
Key words: Power-free languages / Dejean's conjecture / threshold languages / combinatorial complexity / growth rate.
© EDP Sciences, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.