Sliding-block coding for input-restricted channels
IEEE Transactions on Information Theory
Rules for creating certain sophic systems
Theoretical Computer Science
Minimal automation for a factorial, transitive, and rational language
Theoretical Computer Science
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Multiplicities of covers for sofic shifts
Theoretical Computer Science
Varieties Of Formal Languages
Theory of Codes
Sofic and almost of finite type tree-shifts
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Theory of Computing Systems
Theory of Computing Systems
| Hi-index | 0.00 |
We define new subclasses of the class of irreducible sofic shifts. These classes form an infinite hierarchy where the lowest class is the class of almost finite type shifts introduced by B. Marcus. We give effective characterizations of these classes with the syntactic semigroups of the shifts. We prove that these classes define invariants for shift equivalence (and thus for conjugacy). Finally, we extend the result to the case of reducible sofic shifts.