Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
The electronic journal of combinatorics, Tome 25 (2018) no. 2
The set of all doubled patterns on $n$ or fewer letters can be avoided on an alphabet with $k$ letters, where $k$ is the least even integer strictly greater than $n+1$, with the exception of $n=4$. The set of all doubled patterns on $4$ or fewer letters can be avoided on the $8$-letter alphabet. The set of all avoidable patterns on $n$ or fewer letters can be avoided on an alphabet with $2(n+2)$ letters.
DOI :
10.37236/7074
Classification :
68R15
Mots-clés : avoidable words, doubled words, global avoidability
Mots-clés : avoidable words, doubled words, global avoidability
Affiliations des auteurs :
George F. McNulty  1
@article{10_37236_7074,
author = {George F. McNulty},
title = {Some variations on a theme of {Irina} {Mel'nichuk} concerning the avoidability of patterns in strings of symbols},
journal = {The electronic journal of combinatorics},
year = {2018},
volume = {25},
number = {2},
doi = {10.37236/7074},
zbl = {1398.68421},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7074/}
}
TY - JOUR AU - George F. McNulty TI - Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols JO - The electronic journal of combinatorics PY - 2018 VL - 25 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.37236/7074/ DO - 10.37236/7074 ID - 10_37236_7074 ER -
%0 Journal Article %A George F. McNulty %T Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols %J The electronic journal of combinatorics %D 2018 %V 25 %N 2 %U http://geodesic.mathdoc.fr/articles/10.37236/7074/ %R 10.37236/7074 %F 10_37236_7074
George F. McNulty. Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols. The electronic journal of combinatorics, Tome 25 (2018) no. 2. doi: 10.37236/7074
Cité par Sources :