Pages that link to "Item:Q5145782"
From MaRDI portal
The following pages link to On the Maximum Order Complexity of the Thue-Morse and Rudin-Shapiro Sequence (Q5145782):
Displaying 10 items.
- Binary sequences derived from differences of consecutive quadratic residues (Q2070259) (← links)
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences (Q2121010) (← links)
- 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 \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence (Q2202887) (← links)
- Morse‐type information on palais‐smale sequences obtained by min‐max principles (Q4321628) (← links)
- SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER (Q5074008) (← links)
- On the distribution of the Rudin-Shapiro function for finite fields (Q5157778) (← links)
- (Q5395582) (← links)
- Note on a Fibonacci parity sequence (Q6159442) (← links)