$n$-words over any alphabet with forbidden any 3-subwords.

Doroslovački, Rade, and Marković, Olivera. "-words over any alphabet with forbidden any 3-subwords.." Novi Sad Journal of Mathematics 30.2 (2000): 159-163. <http://eudml.org/doc/226119>.

@article{Doroslovački2000,
author = {Doroslovački, Rade, Marković, Olivera},
journal = {Novi Sad Journal of Mathematics},
keywords = {word enumeration; forbidden subword; combinatorial identity},
language = {eng},
number = {2},
pages = {159-163},
publisher = {University of Novi Sad, Faculty of Science, Institute of Mathematics},
title = {-words over any alphabet with forbidden any 3-subwords.},
url = {http://eudml.org/doc/226119},
volume = {30},
year = {2000},
}

TY - JOUR
AU - Doroslovački, Rade
AU - Marković, Olivera
TI - -words over any alphabet with forbidden any 3-subwords.
JO - Novi Sad Journal of Mathematics
PY - 2000
PB - University of Novi Sad, Faculty of Science, Institute of Mathematics
VL - 30
IS - 2
SP - 159
EP - 163
LA - eng
KW - word enumeration; forbidden subword; combinatorial identity
UR - http://eudml.org/doc/226119
ER -