Pages that link to "Item:Q2711280"
From MaRDI portal
The following pages link to Sequences of low complexity: Automatic and Sturmian sequences (Q2711280):
Displaying 16 items.
- Combinatorial properties of infinite words associated with cut-and-project sequences (Q558162) (← links)
- Morphic sequences versus automatic sequences (Q832916) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- Maximal pattern complexity of higher dimensional words (Q965228) (← links)
- Puzzles of quasi-finite type, zeta functions and symbolic dynamics for multi-dimensional maps (Q983143) (← links)
- Transcendence of numbers with a low complexity expansion (Q1377590) (← links)
- Algorithmic analysis of irrational rotations in a single neuron model (Q1869962) (← links)
- Complexity of Hartman sequences (Q2388628) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Subword complexity and projection bodies (Q2474326) (← links)
- Maximal pattern complexity of two-dimensional words (Q2503281) (← links)
- Maximal pattern complexity of words over \(\ell\) letters (Q2581466) (← links)
- Trajectories of rotations (Q4238827) (← links)
- Minimum complexity of automatic non sturmian sequences (Q4858845) (← links)
- Complexity of automatic sequences (Q5896135) (← links)
- Double sequences of low complexity (Q5939704) (← links)