Skip to main content
Conference Proceedings

Cellular automata on regular rooted trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7381 LNCS 101-112
DOI: 10.1007/978-3-642-31606-7_9
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Ceccherini-Silberstein, T., Coornaert, M., Fiorenzi, F., & Šunić, Z. (2012). Cellular automata on regular rooted trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7381 LNCS, pp. 101–112). https://doi.org/10.1007/978-3-642-31606-7_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free