RAIRO-Theor. Inf. Appl.
Volume 40, Number 3, July-September 2006Word Avoidability Complexity And Morphisms (WACAM)
|Page(s)||427 - 441|
|Published online||18 October 2006|
A generator of morphisms for infinite words
LaBRI, Université Bordeaux I, 351, cours de la Libération, 33405 Talence Cedex, France; email@example.com
We present an algorithm which produces, in some cases, infinite words avoiding both large fractional repetitions and a given set of finite words. We use this method to show that all the ternary patterns whose avoidability index was left open in Cassaigne's thesis are 2-avoidable. We also prove that there exist exponentially many -free ternary words and -free 4-ary words. Finally we give small morphisms for binary words containing only the squares 2, 12 and (01)² and for binary words avoiding large squares and fractional repetitions.
Mathematics Subject Classification: 68R15
© EDP Sciences, 2006
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.