Cellular Automata on Regular Rooted Trees

DOI10.1007/978-3-642-31606-7_9zbMath1297.68175arXiv1205.6785OpenAlexW1601366707MaRDI QIDQ2914698

Francesca Fiorenzi, Zoran Šunić, Michel Coornaert, Tullio G. 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 automatonfree monoidsurjectivity problemunrestricted Rabin automatonfinite tree automatonsofic tree shift

Mathematics Subject Classification ID

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

Related Items (2)

Sofic tree-shifts ⋮ Cellular automata between sofic tree shifts

This page was built for publication: Cellular Automata on Regular Rooted Trees