Palindromic and abelian complexities in binary recurrent words of ultimate complexity \(n + 2\) (Q4647906)
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: Palindromic and abelian complexities in binary recurrent words of ultimate complexity n + 2 |
scientific article; zbMATH DE number 6103295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Palindromic and abelian complexities in binary recurrent words of ultimate complexity \(n + 2\) |
scientific article; zbMATH DE number 6103295 |
Statements
8 November 2012
0 references
Parikh vectors
0 references
palindrome complexity
0 references
0.8306628465652466
0 references
0.820376455783844
0 references
0.8073272705078125
0 references
0.7903129458427429
0 references
0.7864282131195068
0 references
