Strict Asymptotic Nilpotency in Cellular Automata

Abstract : We discuss the problem of which subshifts support strictly asymptotically nilpotent CA, that is, asymptotically nilpotent CA which are not nilpotent. The author talked about this problem in AUTOMATA and JAC 2012, and this paper discusses the (lack of) progress since. While the problem was already solved in 2012 on a large class of multidimensional SFTs, the full solutions are not known for one-dimensional sofics, multidimensional SFTs, and full shifts on general groups. We believe all of these questions are interesting in their own way, and discuss them in some detail, along with some context.
Type de document :
Communication dans un congrès
Alberto Dennunzio; Enrico Formenti; Luca Manzoni; Antonio E. Porreca. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10248, pp.3-15, 2017, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-58631-1_1〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01656359
Contributeur : Hal Ifip <>
Soumis le : mardi 5 décembre 2017 - 15:42:34
Dernière modification le : mardi 5 décembre 2017 - 15:55:40

Fichier

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

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

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Ville Salo. Strict Asymptotic Nilpotency in Cellular Automata. Alberto Dennunzio; Enrico Formenti; Luca Manzoni; Antonio E. Porreca. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10248, pp.3-15, 2017, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-319-58631-1_1〉. 〈hal-01656359〉

Partager

Métriques

Consultations de la notice

53