Avoidability index for binary patterns with reversal
The electronic journal of combinatorics, Tome 23 (2016) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

For every pattern $p$ over the alphabet $\{x,x^R,y, y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.
DOI : 10.37236/5483
Classification : 68R15
Mots-clés : combinatorics on words, words avoiding patterns, reversals

James Currie  1   ; Philip Lafrance  1

1 University of Winnipeg
@article{10_37236_5483,
     author = {James Currie and Philip Lafrance},
     title = {Avoidability index for binary patterns with reversal},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {1},
     doi = {10.37236/5483},
     zbl = {1332.68177},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/5483/}
}
TY  - JOUR
AU  - James Currie
AU  - Philip Lafrance
TI  - Avoidability index for binary patterns with reversal
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/5483/
DO  - 10.37236/5483
ID  - 10_37236_5483
ER  - 
%0 Journal Article
%A James Currie
%A Philip Lafrance
%T Avoidability index for binary patterns with reversal
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/5483/
%R 10.37236/5483
%F 10_37236_5483
James Currie; Philip Lafrance. Avoidability index for binary patterns with reversal. The electronic journal of combinatorics, Tome 23 (2016) no. 1. doi: 10.37236/5483

Cité par Sources :