Pages that link to "Item:Q2372778"
From MaRDI portal
The following pages link to Substitution dynamical systems on infinite alphabets (Q2372778):
Displayed 7 items.
- Properties and limits of recognition of sets of integers by countable automata (Q628831) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- Avoiding squares and overlaps over the natural numbers (Q1045019) (← links)
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- Invariant measures for the subshifts arising from non-primitive substitutions (Q2479626) (← links)
- Drunken man infinite words complexity (Q3526419) (← links)
- Aperiodic substitution systems and their Bratteli diagrams (Q3598962) (← links)