On the growth rates of complexity of threshold languages

Original language	English
Pages (from-to)	175-192
Number of pages	18
Journal	RAIRO - Theoretical Informatics and Applications
Volume	44
Issue number	1
DOIs	https://doi.org/10.1051/ita/2010012
Publication status	Published - Feb 2010

Combinatorial complexity, Dejean's conjecture, Growth rate, Power-free languages, Threshold languages

ID: 30123676