UNARY PATTERNS WITH INVOLUTION
Bastian Bischoff, James D. Currie, Dirk Nowotka · International Journal of Foundations of Computer Science · 2012
An infinite word w avoids a pattern p with the involution if there is no substitution for the variables in p and no involution on substituted variables such that the resulting word is a factor of w. An avoidance index of pattern p is the smallest alphabet size for which a word exists such that p is avoided. A pattern is called unary, if only one variable occurs in it. In this paper, we give the avoidance indices for all unary patterns with involution.