Binary words avoiding the pattern AABBCABBA
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 44, Issue: 1, page 151-158
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topReferences
top- K.A. Baker, G.F. McNulty and W. Taylor, Growth problems for avoidable words. Theoret. Comput. Sci.69 (1989) 319–345.
- J. Berstel, Axel Thue's papers on repetitions in words: a translation. Publications du LaCIM, Département de mathématiques et d'informatique 95, Université du Québec à Montréal (1995). berstel/Articles/1994ThueTranslation.pdf URIhttp://www-igm.univ-mlv.fr/
- J. Berstel, Growth of repetition-free words - a review. Theoret. Comput. Sci.340 (2005) 280–290.
- J. Cassaigne, Motifs évitables et régularité dans les mots. Thèse de Doctorat, Université Paris VI (1994).
- R.J. Clark, Avoidable formulas in combinatorics on words. Ph.D. thesis, University of California, Los Angeles (2001).
- R. Kolpakov, Efficient lower bounds on the number of repetition-free words. J. Integer Sequences10 (2007) Article 07.3.2.
- P. Ochem, A generator of morphisms for infinite words. RAIRO-Theor. Inf. Appl.40 (2006) 427–441.
- P. Ochem, Letter frequency in infinite repetition-free words. Theoret. Comput. Sci.380 (2007) 388–392.
- P. Ochem and T. Reix, Upper bound on the number of ternary square-free words, Proceedings of the Workshop on Words and Automata (WOWA'06) (St Petersburg, June 2006). ochem/morphisms/wowa.ps URIhttp://www.lri.fr/
- A.M. Shur, Combinatorial complexity of regular languages. CSR 2008. Lect. Notes Comput. Sci.5010 (2008) 289–301.
- A.I. Zimin, Blocking sets of terms. Math. USSR Sbornik47 (1984) 353–364. English translation.