Cellular automata on regular rooted trees

Authors:
Tullio Ceccherini-Silberstein;Michel Coornaert;Francesca Fiorenzi;Zoran Šuni$#263
Affiliations:
Dipartimento di Ingegneria, Università del Sannio, Benevento, Italy;Institut de Recherche Mathématique Avancée, UMR 7501, Univ. Strasbourg, Strasbourg Cedex, France;Laboratoire de Recherche en Informatique, UMR 8623, Bât 650 Univ. Paris-Sud 11, Orsay Cedex, Orsay, France;Department of Mathematics, Texas A&M University, College Station, TX
Venue:
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Year:
2012

Citing 5
Cited 3

Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Cellular automata and strongly irreducible shifts of finite type

Theoretical Computer Science
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences
Sofic and almost of finite type tree-shifts

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications

Cellular automata between sofic tree shifts

Theoretical Computer Science
Sofic Tree-Shifts

Theory of Computing Systems
Sofic Tree-Shifts

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

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.