Pattern Avoidability with Involution

Bischoff, Bastian and Nowotka, Dirk (2011) Pattern Avoidability with Involution [Paper] In: WORDS, 12-16 Sept 2011, Prague, Czech Republic.

[img]
Preview
Text
unavoidable_patterns.pdf

Download (272Kb) | Preview

Supplementary data:

Abstract

An infinte word w avoids a pattern p with the involution f if there is no substitution for the variables in p and no involution f 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 x f(x) x can be avoided over three letters but not two letters, whereas it is well known that x x x is avoidable over two letters.

Document Type: Conference or Workshop Item (Paper)
Keywords: combinatorics on words avoidability involution
Research affiliation: Kiel University > Faculty of Engineering > Department of Computer Science > Dependable Systems
Refereed: Yes
DOI etc.: 10.4204/EPTCS.63.10
ISSN: 2075-2180
Date Deposited: 01 Nov 2012 04:59
Last Modified: 15 Feb 2013 21:04
URI: http://eprints.uni-kiel.de/id/eprint/16821

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...