Calculation of the complexities of substitutive sequences over a binary alphabet (Q5064032)
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: Calculation of the complexities of substitutive sequences over a binary alphabet |
scientific article; zbMATH DE number 7494735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculation of the complexities of substitutive sequences over a binary alphabet |
scientific article; zbMATH DE number 7494735 |
Statements
Calculation of the complexities of substitutive sequences over a binary alphabet (English)
0 references
21 March 2022
0 references
substitution
0 references
special word
0 references
complexity
0 references
0.8057176470756531
0 references
0.8057176470756531
0 references
0.797950029373169
0 references
0.7936697006225586
0 references
0.7860633134841919
0 references
