Sofic and almost of finite type tree-shifts
From MaRDI portal
Publication:3569727
DOI10.1007/978-3-642-13182-0_2zbMATH Open1285.68078OpenAlexW1600687463MaRDI QIDQ3569727FDOQ3569727
Authors: Nathalie Aubrun, Marie-Pierre Béal 
Publication date: 22 June 2010
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_2
Recommendations
Cited In (17)
- Cellular automata between sofic tree shifts
- A language hierarchy and kitchens-type theorem for self-similar groups
- On the stability and shadowing of tree-shifts of finite type
- Tree-shifts of finite type
- Cellular automata on regular rooted trees
- Entropy on regular trees
- A sofic system which is not spectrally of finite type
- Tree shift topological entropy
- Mathematical Foundations of Computer Science 2004
- Covers of Non-Almost-Finite Type Sofic Systems
- Characterization and topological behavior of homomorphism tree-shifts
- Decidability of Conjugacy of Tree-Shifts of Finite Type
- Decidability of irreducible tree shifts of finite type
- Sofic tree-shifts
- Tree algebra of sofic tree languages
- Countable sofic shifts with a periodic direction
- On the structure of covers of sofic shifts
This page was built for publication: Sofic and almost of finite type tree-shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569727)
