The subword complexity of a two-parameter family of sequences.
Fraenkel, Aviezri S. ; Seeman, Tamar ; Simpson, Jamie
The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:121682 
@article{01638988,
     title = {The subword complexity of a two-parameter family of sequences.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {8},
     year = {2001},
     zbl = {0981.68125},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01638988}
}

Fraenkel, Aviezri S.; Seeman, Tamar; Simpson, Jamie. The subword complexity of a two-parameter family of sequences.. The Electronic Journal of Combinatorics [electronic only], Tome 8 (2001) . http://gdmltest.u-ga.fr/item/01638988/