Abelian complexity and frequencies of letters in infinite words (Q2833546)
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 6654714
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Abelian complexity and frequencies of letters in infinite words |
scientific article; zbMATH DE number 6654714 |
Statements
18 November 2016
0 references
infinite word
0 references
Parikh vectors
0 references
abelian complexity
0 references
uniform recurrence
0 references
uniform frequencies
0 references
Abelian complexity and frequencies of letters in infinite words (English)
0 references
0.8380745649337769
0 references
0.8380600810050964
0 references
0.8308367133140564
0 references
0.8294675350189209
0 references
0.8265672922134399
0 references
