Do the properties of an \(S\)-adic representation determine factor complexity? (Q5404286)
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 6272379
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Do the properties of an \(S\)-adic representation determine factor complexity? |
scientific article; zbMATH DE number 6272379 |
Statements
24 March 2014
0 references
factor complexity
0 references
\(S\)-adicity
0 references
\(S\)-adic conjecture
0 references
morphism
0 references
subword complexity
0 references
linear complexity
0 references
uniform recurrence
0 references
0.8620648384094238
0 references
0.84383225440979
0 references
0.8071380257606506
0 references
0.8037869334220886
0 references
0.7695410847663879
0 references
