On graph induced symbolic systems

From MaRDI portal
Publication:6179475



Abstract: �egin{abstract} In this paper, we investigate a shift arising from graph G. We prove that any k-dimensional shift of finite type can be generated through a k-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 (m,n)-periodic point (for some m,ninmathbbZsetminus0). 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.












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)