On the computation of Arnold complexity of length \(2^{n}\) binary words (Q3013879)
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 5925632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computation of Arnold complexity of length \(2^{n}\) binary words |
scientific article; zbMATH DE number 5925632 |
Statements
ON THE COMPUTATION OF ARNOLD COMPLEXITY OF LENGTH 2<sup>n</sup> BINARY WORDS (English)
0 references
19 July 2011
0 references
binary word
0 references
complexity words
0 references
Arnold complexity
0 references
0.8700031042098999
0 references
0.8421447277069092
0 references
0.7434912919998169
0 references
