2 results
On the growth rates of complexity of threshold languages
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 44 / Issue 1 / January 2010
- Published online by Cambridge University Press:
- 11 February 2010, pp. 175-192
- Print publication:
- January 2010
-
- Article
- Export citation
Dejean's conjecture holds for N ≥ 27
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 4 / October 2009
- Published online by Cambridge University Press:
- 29 September 2009, pp. 775-778
- Print publication:
- October 2009
-
- Article
- Export citation