A note on constructing infinite binary words with polynomial subword complexity (Q4928768)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on constructing infinite binary words with polynomial subword complexity |
scientific article; zbMATH DE number 6176637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on constructing infinite binary words with polynomial subword complexity |
scientific article; zbMATH DE number 6176637 |
Statements
A note on constructing infinite binary words with polynomial subword complexity (English)
0 references
18 June 2013
0 references
binary words
0 references
subword complexity
0 references
gap function
0 references
0.8865749835968018
0 references
0.7863216996192932
0 references
0.7772566676139832
0 references
0.7753772139549255
0 references
