%0 Conference Proceedings
%T Strict Asymptotic Nilpotency in Cellular Automata
%+ University of Turku
%A Salo, Ville
%Z Part 1: Invited Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Milan, Italy
%Y Alberto Dennunzio
%Y Enrico Formenti
%Y Luca Manzoni
%Y Antonio E. Porreca
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-10248
%P 3-15
%8 2017-06-07
%D 2017
%R 10.1007/978-3-319-58631-1_1
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01656359/document
%2 https://inria.hal.science/hal-01656359/file/447449_1_En_1_Chapter.pdf
%L hal-01656359
%U https://inria.hal.science/hal-01656359
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ IFIP-LNCS-10248