Pattern Avoidability with Involution.

Tools

Bischoff, Bastian and Nowotka, Dirk (2011) Pattern Avoidability with Involution. [Paper] In: WORDS. , 12-16 Sept 2011, Prague, Czech Republic . Words. ; pp. 65-70 . DOI 10.4204/EPTCS.63.10. EPTCS .

[thumbnail of unavoidable_patterns.pdf]
Preview
 Text
unavoidable_patterns.pdf
Download (279kB) | 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
Refereed: Yes
Date Deposited: 01 Nov 2012 04:59
Last Modified: 23 Sep 2019 17:48
URI: https://oceanrep.geomar.de/id/eprint/16821

Actions (login required)

View Item View Item