The following pages link to Two notes on subshifts (Q5390213):
Displayed 15 items.
- Computability of countable subshifts in one dimension (Q693067) (← links)
- Finitely presented expansions of computably enumerable semigroups (Q1936272) (← links)
- The relationship between word complexity and computational complexity in subshifts (Q1995561) (← links)
- Compressibility and probabilistic proofs (Q2011640) (← links)
- On computably enumerable structures (Q2263114) (← links)
- Turing degree spectra of minimal subshifts (Q2399371) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- Computability in Symbolic Dynamics (Q3188248) (← links)
- Automatic Sequences and Generalised Polynomials (Q5222169) (← links)
- Shift-complex sequences (Q5300087) (← links)
- Finitely presented expansions of groups, semigroups, and algebras (Q5401728) (← links)
- Medvedev degrees of two-dimensional subshifts of finite type (Q5415947) (← links)
- On subshifts with slow forbidden word growth (Q5863424) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Entropy bounds for multi-word perturbations of subshifts (Q6143505) (← links)