Pages that link to "Item:Q837149"
From MaRDI portal
The following pages link to On the joint subword complexity of automatic sequences (Q837149):
Displaying 8 items.
- Automatic complexity of shift register sequences (Q724846) (← links)
- Subword complexity and non-automaticity of certain completely multiplicative functions (Q730313) (← links)
- Complexity of generalized Rudin-Shapiro sequences (Q1320516) (← links)
- Automata calculating the complexity of automatic sequences (Q1340682) (← links)
- Subword complexity and projection bodies (Q2474326) (← links)
- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions (Q2945649) (← links)
- Minimum complexity of automatic non sturmian sequences (Q4858845) (← links)
- The subword complexity of a two-parameter family of sequences (Q5942564) (← links)