Factor versus palindromic complexity of uniformly recurrent infinite words (Q2373751)
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: Factor versus palindromic complexity of uniformly recurrent infinite words |
scientific article; zbMATH DE number 5171366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factor versus palindromic complexity of uniformly recurrent infinite words |
scientific article; zbMATH DE number 5171366 |
Statements
Factor versus palindromic complexity of uniformly recurrent infinite words (English)
0 references
16 July 2007
0 references
palindrome
0 references
infinite words
0 references
interval exchange transformations
0 references
palindromic complexity
0 references
factor complexity
0 references
uniformly recurrent words
0 references
0 references
0.8150889873504639
0 references
0.8106918334960938
0 references
0.8077687621116638
0 references
0.7914609313011169
0 references
0.7907992005348206
0 references
