Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/24602

Title: Binary patterns in binary cube-free words: avoidability and growth
Authors: Mercas, Robert
Ochem, Pascal
Samsonov, Alexey V.
Shur, Arseny M.
Issue Date: 2014
Publisher: EDP Sciences
Citation: MERCAS, R. ... et al, 2014. Binary patterns in binary cube-free words: avoidability and growth. RAIRO - Theoretical Informatics and Applications, 48 (4), pp.369-389
Abstract: The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growth rates of languages avoiding minimal avoidable patterns are approximated through computer-assisted upper bounds. Finally, a new example of a pattern-avoiding language of polynomial growth is given.
Description: The original publication is available at www.rairo-ita.org.
Version: Published
DOI: 10.1051/ita/2014015
URI: https://dspace.lboro.ac.uk/2134/24602
Publisher Link: http://dx.doi.org/10.1051/ita/2014015
ISSN: 0988-3754
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
RAIROMercas-et-al-Binary-patterns-2014.pdf666.17 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.