Pages that link to "Item:Q730313"
From MaRDI portal
The following pages link to Subword complexity and non-automaticity of certain completely multiplicative functions (Q730313):
Displaying 9 items.
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- On completely multiplicative automatic sequences (Q2182171) (← links)
- A note on multiplicative automatic sequences (Q2337307) (← links)
- Subword complexity and Laurent series (Q2855524) (← links)
- Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (Q3460055) (← links)
- On multiplicative automatic sequences (Q5110610) (← links)
- A note on multiplicative automatic sequences, II (Q5110611) (← links)
- Automatic sequences are orthogonal to aperiodic multiplicative functions (Q5918414) (← links)