On Finite Monoids of Cellular Automata

Abstract : For any group G and set A, a cellular automaton over G and A is a transformation τ : A G A G defined via a finite neighbourhood S G (called a memory set of τ ) and a local function μ : A S A . In this paper, we assume that G and A are both finite and study various algebraic properties of the finite monoid C A ( G , A ) consisting of all cellular automata over G and A. Let I C A ( G ; A ) G and A. In the first part, using information on the conjugacy classes of subgroups of G, we give a detailed description of the structure of I C A ( G ; A ) in terms of direct and wreath products. In the second part, we study generating sets of C A ( G ; A ) . In particular, we prove that C A ( G , A ) cannot be generated by cellular automata with small memory set, and, when G is finite abelian, we determine the minimal size of a set V C A ( G ; A ) such that C A ( G ; A ) = I C A ( G ; A ) V .
Type de document :
Communication dans un congrès
Matthew Cook; Turlough Neary. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. Lecture Notes in Computer Science, LNCS-9664, pp.90-104, 2016, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-39300-1_8〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01435036
Contributeur : Hal Ifip <>
Soumis le : vendredi 13 janvier 2017 - 15:24:12
Dernière modification le : lundi 16 janvier 2017 - 10:50:43
Document(s) archivé(s) le : vendredi 14 avril 2017 - 20:30:52

Fichier

 Accès restreint
Fichier visible le : 2019-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Alonso Castillo-Ramirez, Maximilien Gadouleau. On Finite Monoids of Cellular Automata. Matthew Cook; Turlough Neary. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. Lecture Notes in Computer Science, LNCS-9664, pp.90-104, 2016, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-39300-1_8〉. 〈hal-01435036〉

Partager

Métriques

Consultations de la notice

108