Binary recurrent words of ultimate complexity \(n+2\) (Q5403337)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6274093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary recurrent words of ultimate complexity \(n+2\) |
scientific article; zbMATH DE number 6274093 |
Statements
25 March 2014
0 references
Sturmian words
0 references
special factors
0 references
morphisms
0 references
0.8306628465652466
0 references
0.7675319314002991
0 references
0.7565116286277771
0 references
0.7516716122627258
0 references
0.7514618635177612
0 references
