$n$-words over any alphabet without subword $a\underset{k-1}{\underbrace{b\cdots b}}a$ for fixed $a$, $b$ and $k$.

Doroslovački, Rade, and Marković, Olivera. "-words over any alphabet without subword for fixed , and .." Novi Sad Journal of Mathematics 30.2 (2000): 165-170. <http://eudml.org/doc/229862>.

@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 = {165-170},
publisher = {University of Novi Sad, Faculty of Science, Institute of Mathematics},
title = {-words over any alphabet without subword for fixed , and .},
url = {http://eudml.org/doc/229862},
volume = {30},
year = {2000},
}

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