Pattern Avoidability with Involution
Formal Languages and Automata Theory
2011-08-19 v1 Discrete Mathematics
Combinatorics
Abstract
An infinte word w avoids a pattern p with the involution t if there is no substitution for the variables in p and no involution t such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the size of the alphabet. For example, it is shown that the pattern a t(a) a can be avoided over three letters but not two letters, whereas it is well known that a a a is avoidable over two letters.
Cite
@article{arxiv.1108.3622,
title = {Pattern Avoidability with Involution},
author = {Bastian Bischoff and Dirk Nowotka},
journal= {arXiv preprint arXiv:1108.3622},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412