The following pages link to (Q4071156):
Displaying 10 items.
- Entropy for symbolic dynamics with overlapping alphabets (Q300352) (← links)
- Brudno's theorem for \(\mathbb{Z}^d\) (or \(\mathbb{Z}_+^d\)) subshifts (Q515582) (← links)
- Eulerian entropy and non-repetitive subword complexity (Q764367) (← links)
- Combinatorial lemmas and applications to dynamics (Q1011403) (← links)
- An announce of results linking Kolmogorov complexity to entropy for amenable group actions (Q2307955) (← links)
- Topological arguments for Kolmogorov complexity (Q2354581) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- (Q4655020) (← links)
- On Oscillation-free ε-random Sequences (Q4918022) (← links)
- Computable Følner monotilings and a theorem of Brudno (Q5156795) (← links)