Sofic and almost of finite type tree-shifts

DOI10.1007/978-3-642-13182-0_2MaRDI QIDQ3569727zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Formal languages and automata (68Q45)

Recommendations

• Sofic tree-shifts
• Mathematical Foundations of Computer Science 2004
• Tree algebra of sofic tree languages
• Tree-shifts of finite type
• Cellular automata between sofic tree shifts

Cited in

(17)

• Tree shift topological entropy
• Tree-shifts of finite type
• Entropy on regular trees
• Countable sofic shifts with a periodic direction
• Characterization and topological behavior of homomorphism tree-shifts
• Decidability of irreducible tree shifts of finite type
• A language hierarchy and kitchens-type theorem for self-similar groups
• Cellular automata on regular rooted trees
• Tree algebra of sofic tree languages
• Decidability of Conjugacy of Tree-Shifts of Finite Type
• A sofic system which is not spectrally of finite type
• Covers of Non-Almost-Finite Type Sofic Systems
• Sofic tree-shifts
• Cellular automata between sofic tree shifts
• Mathematical Foundations of Computer Science 2004
• On the structure of covers of sofic shifts
• On the stability and shadowing of tree-shifts of finite type

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)