| Issue |
RAIRO-Theor. Inf. Appl.
Volume 44, Number 1, January-March 2010
Special issue dedicated to the 12th "Journées Montoises d'Informatique Théorique"
|
|
|---|---|---|
| Page(s) | 151 - 158 | |
| DOI | https://doi.org/10.1051/ita/2010010 | |
| Published online | 11 February 2010 | |
Binary words avoiding the pattern AABBCABBA
1
CNRS, Lab. J.V. Poncelet, Moscow; ochem@lri.fr
2
LRI, Bât 490 Université Paris-Sud 11, 91405 Orsay Cedex, France.
We show that there are three types of infinite words over the two-letter
alphabet {0,1} that avoid the pattern AABBCABBA. These types, P, E0, and E1,
differ by the factor complexity and the asymptotic frequency of the letter 0.
Type P has polynomial factor complexity and letter frequency 
.
Type E0 has exponential factor complexity and the frequency of the letter 0 is at least
0.45622 and at most 0.48684. Type E1 is obtained from type E0 by exchanging 0 and 1.
Mathematics Subject Classification: 68R15
Key words: Combinatorics on words / letter frequency / factor complexity
© 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.