On minimal words with given subword complexity.
Wang, Ming-wei; Shallit, Jeffrey
The Electronic Journal of Combinatorics [electronic only] (1998)
- Volume: 5, Issue: 1, page Research paper R35, 16 p.-Research paper R35, 16 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topWang, Ming-wei, and Shallit, Jeffrey. "On minimal words with given subword complexity.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper R35, 16 p.-Research paper R35, 16 p.. <http://eudml.org/doc/119600>.
@article{Wang1998,
author = {Wang, Ming-wei, Shallit, Jeffrey},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {minimal length of a word},
language = {eng},
number = {1},
pages = {Research paper R35, 16 p.-Research paper R35, 16 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On minimal words with given subword complexity.},
url = {http://eudml.org/doc/119600},
volume = {5},
year = {1998},
}
TY - JOUR
AU - Wang, Ming-wei
AU - Shallit, Jeffrey
TI - On minimal words with given subword complexity.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1998
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 5
IS - 1
SP - Research paper R35, 16 p.
EP - Research paper R35, 16 p.
LA - eng
KW - minimal length of a word
UR - http://eudml.org/doc/119600
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.