Finite state automata representing two-dimensional subshifts

A new type of two-dimensional automaton has been defined to recognize a class of two-dimensional shifts of finite type having the property that every admissible block found within the related local picture language can be extended to a point of the subshift. Here it is shown that this automaton accurately represents the image of the represented two-dimensional shift of finite type under a block code. It is then shown that these automata can be used to check for a certain type of two-dimensional transitivity in the factor language of the corresponding shift space and how this relates to periodicity in the two-dimensional case. The paper closes with a notion of ''follower sets'' that are used to reduce the size of the automata representing two-dimensional sofic shifts.

[1]  Klaus Schmidt,et al.  Automorphisms of compact groups , 1989, Ergodic Theory and Dynamical Systems.

[2]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[3]  Nataša Jonoska,et al.  The symbolic dynamics of multidimensional tiling systems , 2003, Ergodic Theory and Dynamical Systems.

[4]  Jarkko Kari,et al.  A small aperiodic set of Wang tiles , 1996, Discret. Math..

[5]  Michel Latteux,et al.  Recognizable Picture Languages and Domino Tiling , 1997, Theor. Comput. Sci..

[6]  Natasa Jonoska,et al.  Transitivity in Two-dimensional Local Languages Defined by Dot Systems , 2006, Int. J. Found. Comput. Sci..

[7]  Michael E. Paul,et al.  Matrix Subshifts for Zv Symbolic Dynamics , 1981 .

[8]  Douglas Lind,et al.  An Introduction to Symbolic Dynamics and Coding , 1995 .

[9]  Aimee S. A. Johnson,et al.  The decomposition theorem for two-dimensional shifts of finite type , 1999 .

[10]  Antonio Restivo,et al.  Two-Dimensional Languages , 1997, Handbook of Formal Languages.

[11]  Robert L. Berger.  The undecidability of the domino problem , 1966 .