Unary patterns with involution

Bischoff, Bastian, Currie, James and Nowotka, Dirk (In Press / Accepted) Unary patterns with involution International Journal of Foundations of Computer Science .


Download (383Kb) | Preview


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.

Document Type: Article
Keywords: combinatorics on words avoidance involution
Research affiliation: Kiel University > Faculty of Engineering > Department of Computer Science > Dependable Systems
Refereed: Yes
ISSN: 0129-0541
Date Deposited: 01 Feb 2013 16:11
Last Modified: 11 Nov 2013 13:16
URI: http://eprints.uni-kiel.de/id/eprint/20231

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...