Cellular automata on regular rooted trees

DOI10.1007/978-3-642-31606-7_9MaRDI QIDQ2914698zbMATH OpenOpenAlexFDO

Authors Michel Coornaert, Francesca Fiorenzi, Zoran Šunić, Tullio Ceccherini-Silberstein

Publication date 20 September 2012

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1205.6785

zbMATH Keywords

cellular automatonfinite tree automatonfree monoidsofic tree shiftsurjectivity problemunrestricted Rabin automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Abstract: We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.

Recommendations

• Cellular automata between sofic tree shifts
• Sofic tree-shifts
• Tree algebra of sofic tree languages
• Topological properties of cellular automata on trees
• Sofic and almost of finite type tree-shifts

Cited in

(7)

• Computational aspects of cellular automata on countable sofic shifts
• scientific article; zbMATH DE number 3938573 (Why is no real title available?)
• Sofic tree-shifts
• Cellular automata between sofic tree shifts
• Topological properties of cellular automata on trees
• On von Neumann regularity of cellular automata
• Von Neumann regularity, split epicness and elementary cellular automata

This page was built for publication: Cellular automata on regular rooted trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914698)