The Maximal Subword Complexity of Quasiperiodic Infinite Words (Q4964023)
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: The Maximal Subword Complexity of Quasiperiodic Infinite Words |
scientific article; zbMATH DE number 7315102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Maximal Subword Complexity of Quasiperiodic Infinite Words |
scientific article; zbMATH DE number 7315102 |
Statements
24 February 2021
0 references
quasiperiodic words
0 references
codes, subword complexity
0 references
structure-generating function
0 references
cs.FL
0 references
cs.DM
0 references
cs.IT
0 references
math.IT
0 references
0.9209056
0 references
0.91607785
0 references
0.90683734
0 references
0 references
0.89749265
0 references
0.89251626
0 references
0 references
0.8858801
0 references
0.88405275
0 references
0.88346064
0 references
