Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, December 5, 2017 - 3:42:34 PM
Last modification on : Tuesday, December 5, 2017 - 3:55:40 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Ville Salo. Strict Asymptotic Nilpotency in Cellular Automata. 23th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2017, Milan, Italy. pp.3-15, ⟨10.1007/978-3-319-58631-1_1⟩. ⟨hal-01656359⟩



Record views


Files downloads