On graph induced symbolic systems
From MaRDI portal
Publication:6179475
Abstract: �egin{abstract} In this paper, we investigate a shift arising from graph . We prove that any -dimensional shift of finite type can be generated through a -dimensional graph. We investigate the structure of the shift space using the generating matrices for the shift space. We prove that a two dimensional shift space has a horizontally (vertically) periodic point if and only if it possesses a -periodic point (for some ). We prove that a shift space is finite if and only if it can be generated by permutation matrices. We study the non-emptiness problem and existence of periodic points in terms of the generating matrices.
Recommendations
Cites work
- A characterization of the entropies of multidimensional shifts of finite type
- A Mathematical Theory of Communication
- An Introduction to Symbolic Dynamics and Coding
- Characterizations of periods of multi-dimensional shifts
- Finite state automata representing two-dimensional subshifts
- scientific article; zbMATH DE number 2079138 (Why is no real title available?)
- Matrix characterization of multidimensional subshifts of finite type
- Morphisms from non-periodic \mathbb{Z}^{2} subshifts I: constructing embeddings from homomorphisms
- Mutidimensional shifts and finite matrices
- Subshifts of multi-dimensional shifts of finite type
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Symbolic representations of iterated maps
- The decomposition theorem for two-dimensional shifts of finite type
- The symbolic dynamics of multidimensional tiling systems
- The undecidability of the domino problem
Cited in
(2)
This page was built for publication: On graph induced symbolic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179475)