The following pages link to Computable symbolic dynamics (Q3528142):
Displaying 23 items.
- Turing degrees of multidimensional SFTs (Q393140) (← links)
- Computability of countable subshifts in one dimension (Q693067) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts (Q1034609) (← links)
- Symbolic dynamics and characterization of complexity (Q1181164) (← links)
- Finitely presented expansions of computably enumerable semigroups (Q1936272) (← links)
- Turing degree spectra of minimal subshifts (Q2399371) (← links)
- $\it \Pi^0_1$ Sets and Tilings (Q3010404) (← links)
- Symbolic Dynamics, Flower Automata and Infinite Traces (Q3073631) (← links)
- Computability in Symbolic Dynamics (Q3188248) (← links)
- (Q3416092) (← links)
- Symbolic dynamics and finite automata (Q3569002) (← links)
- Structure and uncomputability in one-dimensional maps (Q3981973) (← links)
- Cototal enumeration degrees and their applications to effective mathematics (Q4563667) (← links)
- About the Domino Problem for Subshifts on Groups (Q4613553) (← links)
- (Q4868395) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- SYMBOLIC DYNAMICS GENERATED BY A COMBINATION OF GRAPHS (Q5322540) (← links)
- Finitely presented expansions of groups, semigroups, and algebras (Q5401728) (← links)
- Medvedev degrees of two-dimensional subshifts of finite type (Q5415947) (← links)
- FROM SYMBOLIC DYNAMICS TO A DIGITAL APPROACH (Q5471615) (← links)
- (Q5688255) (← links)
- Dynamical aspects of \(\sigma\)-machines (Q6098077) (← links)
