On the Irreducibility of Certain Shifts of Finite Type

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

[2]  Antonio Restivo,et al.  Automata and Forbidden Words , 1998, Inf. Process. Lett..

[3]  Akiko Manada.  On a Shannon cover of certain reducible shift of finite type , 2012, 2012 International Symposium on Information Theory and its Applications.

[4]  Ota Takahiro,et al.  Branch Prediction Based on Antidictionary Tree , 2007 .

[5]  A. Restivo,et al.  Data compression using antidictionaries , 2000, Proceedings of the IEEE.

[6]  Brian H. Marcus,et al.  Maximum insertion rate and capacity of multidimensional constraints , 2008, 2008 IEEE International Symposium on Information Theory.