5 results
Binary patterns in binary cube-free words: Avoidability and growth∗
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 48 / Issue 4 / October 2014
- Published online by Cambridge University Press:
- 17 July 2014, pp. 369-389
- Print publication:
- October 2014
-
- Article
- Export citation
On Abelian repetition threshold
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 1 / January 2012
- Published online by Cambridge University Press:
- 14 November 2011, pp. 147-163
- Print publication:
- January 2012
-
- Article
- Export citation
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
Polynomial languages with finite antidictionaries
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 2 / April 2009
- Published online by Cambridge University Press:
- 22 November 2008, pp. 269-279
- Print publication:
- April 2009
-
- Article
- Export citation
Comparing Complexity Functions of a Language and Its Extendable Part
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 3 / July 2008
- Published online by Cambridge University Press:
- 03 June 2008, pp. 647-655
- Print publication:
- July 2008
-
- Article
- Export citation