n-words over any alphabet without subword ab⋯b︸k-1a for fixed a, b and k.
Doroslovački, Rade ; Marković, Olivera
Novi Sad Journal of Mathematics, Tome 30 (2000), p. 165-170 / Harvested from The Electronic Library of Mathematics
Publié le : 2000-01-01
EUDML-ID : urn:eudml:doc:229862
@article{01868919,
     title = {<title-group xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><article-title xml:lang="en"><math><mi>n</mi></math>-words over any alphabet without subword <math><mrow><mi>a</mi><munder><munder accentunder="true"><mrow><mi>b</mi><mo>[?]</mo><mi>b</mi></mrow><mo>} </mo></munder><mrow><mi>k</mi><mo>-</mo><mn>1</mn></mrow></munder><mi>a</mi></mrow></math> for fixed <math><mi>a</mi></math>, <math><mi>b</mi></math> and <math><mi>k</mi></math>.</article-title></title-group>},
     journal = {Novi Sad Journal of Mathematics},
     volume = {30},
     year = {2000},
     pages = {165-170},
     zbl = {1007.05010},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01868919}
}
Doroslovački, Rade; Marković, Olivera. n-words over any alphabet without subword abbk-1a for fixed a, b and k.. Novi Sad Journal of Mathematics, Tome 30 (2000) pp. 165-170. http://gdmltest.u-ga.fr/item/01868919/