Sofic tree-shifts
From MaRDI portal
Publication:385506
DOI10.1007/s00224-013-9456-1zbMath1293.68195OpenAlexW2027381218MaRDI QIDQ385506
Nathalie Aubrun, Marie-Pierre Béal
Publication date: 2 December 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00627797v2/file/TOCS2012.pdf
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Symbolic dynamics (37B10)
Related Items (20)
Entropy dimension of shifts of finite type on free groups ⋮ Tree shift topological entropy ⋮ Topological entropy for shifts of finite type over \(\mathbb{Z}\) and trees ⋮ Entropy on regular trees ⋮ Unnamed Item ⋮ Cellular automata between sofic tree shifts ⋮ Decidability of CPC-irreducibility of subshifts of finite type over free groups ⋮ Large deviation principle of multiplicative Ising models on Markov-Cayley trees ⋮ Topological entropy and sequence entropy for Hom tree-shifts on unexpandable trees ⋮ Mixing properties of tree-shifts ⋮ Tree-shifts: Irreducibility, mixing, and the chaos of tree-shifts ⋮ Characterization and topological behavior of homomorphism tree-shifts ⋮ Reversibility of linear cellular automata on Cayley trees with periodic boundary condition ⋮ Decidability of irreducible tree shifts of finite type ⋮ On structure of topological entropy for tree-shift of finite type ⋮ Entropy Bifurcation of Neural Networks on Cayley Trees ⋮ Tree-shifts: the entropy of tree-shifts of finite type ⋮ Stem and topological entropy on Cayley trees ⋮ A language hierarchy and kitchens-type theorem for self-similar groups ⋮ Characterization for entropy of shifts of finite type on Cayley trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sofic systems. I
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Tree-shifts of finite type
- Reducibility of covers of AFT shifts
- Complexity of weak acceptance conditions in tree automata.
- Symbolic dynamics
- A hierarchy of shift equivalent sofic shifts
- Cellular Automata on Regular Rooted Trees
- Sofic and Almost of Finite Type Tree-Shifts
- Decidability of Conjugacy of Tree-Shifts of Finite Type
- Sofic systems and encoding data
- A Note on Minimal Covers for Sofic Systems
- Covers of Non-Almost-Finite Type Sofic Systems
- The decomposition theorem for two-dimensional shifts of finite type
- The symbolic dynamics of multidimensional tiling systems
- Textile systems for endomorphisms and automorphisms of the shift
- Minimal presentations for irreducible sofic shifts
- An Introduction to Symbolic Dynamics and Coding
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: Sofic tree-shifts
