On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values (Q2129347)
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: On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values |
scientific article |
Statements
On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values (English)
0 references
22 April 2022
0 references
automatic sequences
0 references
pseudorandomness
0 references
Thue-Morse sequence
0 references
Rudin-Shapiro sequence
0 references
polynomials
0 references
0 references
0 references
0.915910303592682
0 references
0.8291186690330505
0 references
0.8018724322319031
0 references
0.8006729483604431
0 references
0.7895861268043518
0 references
