Computability of extender sets in multidimensional subshifts
From MaRDI portal
Cites work
- A characterization of the entropies of multidimensional shifts of finite type
- A class of nonsofic multidimensional shift spaces
- A sufficient condition for non-soficness of higher-dimensional subshifts
- About the domino problem for subshifts on groups
- An introduction to symbolic dynamics and coding
- Characterizing follower and extender set sequences
- Extender sets and multidimensional subshifts
- Fixed-point tile sets and their applications
- Follower, predecessor, and extender entropies
- Growth-type invariants for \(\mathbb Z^{d}\) subshifts of finite type and arithmetical classes of real numbers
- scientific article; zbMATH DE number 2042127 (Why is no real title available?)
- Multidimensional cellular automata and generalization of Fekete's Lemma
- On the dynamics and recursive properties of multidimensional symbolic systems
- Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- Soficity of free extensions of effective subshifts
- Subshifts of finite type and sofic systems
- Subshifts of multi-dimensional shifts of finite type
- Subshifts of quasi-finite type
- Symbolic Dynamics
- The Arithmetical Hierarchy of Real Numbers
- Tilings, substitution systems and dynamical systems generated by them
- Turing computability. Theory and applications
This page was built for publication: Computability of extender sets in multidimensional subshifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287754)
