The subword complexity of a two-parameter family of sequences.
Fraenkel, Aviezri S.; Seeman, Tamar; Simpson, Jamie
The Electronic Journal of Combinatorics [electronic only] (2001)
- Volume: 8, Issue: 2, page Research paper R10, 19 p.-Research paper R10, 19 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topFraenkel, Aviezri S., Seeman, Tamar, and Simpson, Jamie. "The subword complexity of a two-parameter family of sequences.." The Electronic Journal of Combinatorics [electronic only] 8.2 (2001): Research paper R10, 19 p.-Research paper R10, 19 p.. <http://eudml.org/doc/121682>.
@article{Fraenkel2001,
author = {Fraenkel, Aviezri S., Seeman, Tamar, Simpson, Jamie},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {subword complexity},
language = {eng},
number = {2},
pages = {Research paper R10, 19 p.-Research paper R10, 19 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The subword complexity of a two-parameter family of sequences.},
url = {http://eudml.org/doc/121682},
volume = {8},
year = {2001},
}
TY - JOUR
AU - Fraenkel, Aviezri S.
AU - Seeman, Tamar
AU - Simpson, Jamie
TI - The subword complexity of a two-parameter family of sequences.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2001
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 8
IS - 2
SP - Research paper R10, 19 p.
EP - Research paper R10, 19 p.
LA - eng
KW - subword complexity
UR - http://eudml.org/doc/121682
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.