Binary patterns in binary cube-free words: avoidability and growth

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 langua...

Full description

Bibliographic Details

Main Authors:	Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
Format:	Default Article
Published:	2014
Subjects:	Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified untagged Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/24602
Tags:	Add Tag No Tags, Be the first to tag this record!