Unary patterns with involution.

Tools

Bischoff, Bastian, Currie, James and Nowotka, Dirk (2013) Unary patterns with involution. International Journal of Foundations of Computer Science, 23 (8). pp. 1641-1652. DOI 10.1142/S0129054112400679.

[thumbnail of BischoffCurrieNowotka-2013.pdf]
Preview
 Text
BischoffCurrieNowotka-2013.pdf
Download (392kB) | Preview

Supplementary data:

Abstract

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
Refereed: Yes
Open Access Journal?: No
Publisher: World Scientific
Date Deposited: 01 Feb 2013 16:11
Last Modified: 21 Aug 2019 11:03
URI: https://oceanrep.geomar.de/id/eprint/20231

Actions (login required)

View Item View Item