Handbook of theoretical computer science (vol. B)
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
On the Finite Degree of Ambiguity of Finite Tree Automata
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
A hierarchy of shift equivalent sofic shifts
Theoretical Computer Science - Mathematical foundations of computer science 2004
Decidability of Conjugacy of Tree-Shifts of Finite Type
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Elements of Automata Theory
Theoretical Computer Science
Cellular automata on regular rooted trees
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Cellular automata between sofic tree shifts
Theoretical Computer Science
Theory of Computing Systems
Theory of Computing Systems
| Hi-index | 0.00 |
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique minimal deterministic irreducible tree automaton accepting an irreducible sofic tree-shift, but that there is a unique synchronized one, called the Shannon cover of the tree-shift. We define the notion of almost finite type tree-shift which is a meaningful intermediate dynamical class in between irreducible finite type tree-shifts and irreducible sofic tree-shifts. We characterize the Shannon cover of an almost finite type tree-shift and we design an algorithm to check whether a sofic tree-shift is almost of finite type.