Pages that link to "Item:Q2121010"
From MaRDI portal
The following pages link to Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences (Q2121010):
Displaying 4 items.
- On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values (Q2129347) (← links)
- Pseudorandom sequences derived from automatic sequences (Q2154881) (← links)
- On the Maximum Order Complexity of the Thue-Morse and Rudin-Shapiro Sequence (Q5145782) (← links)
- Note on a Fibonacci parity sequence (Q6159442) (← links)