A characterization of subshifts with computable language
From MaRDI portal
Publication:5090490
Recommendations
Cites work
- scientific article; zbMATH DE number 3670685 (Why is no real title available?)
- scientific article; zbMATH DE number 193180 (Why is no real title available?)
- scientific article; zbMATH DE number 3074067 (Why is no real title available?)
- A characterization of the entropies of multidimensional shifts of finite type
- An algebraic characterization of groups with soluble word problem
- An order on sets of tilings corresponding to an order on languages
- Bounded enumeration reducibility and its degree structure
- Characterizations of periods of multi-dimensional shifts
- Combinatorial algebra: syntax and semantics. With contributions by Victor S. Guba and Mikhail V. Volkov
- Combinatorial group theory.
- Effective closed subshifts in 1D can be implemented in 2D
- Enumeration reducibility in closure spaces with applications to logic and algebra
- Factoring higher-dimensional shifts of finite type onto the full shift
- Finite Axiomatizability using additional predicates
- Fixed-point tile sets and their applications
- Mass problems associated with effectively closed sets
- Multidimensional sofic shifts without separation and their factors
- On the dynamics and recursive properties of multidimensional symbolic systems
- On the expressive power of quasiperiodic SFT
- On the topological full group of a minimal Cantor \(\mathbb Z^2\)-system
- Reducibility and Completeness for Sets of Integers
- Simulation of effective subshifts by two-dimensional subshifts of finite type
- Subgroups of finitely presented groups
- The undecidability of the domino problem
Cited in
(4)
This page was built for publication: A characterization of subshifts with computable language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090490)
