Strict Asymptotic Nilpotency in Cellular Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Strict Asymptotic Nilpotency in Cellular Automata

Ville Salo
  • Function : Author
  • PersonId : 998313


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.
Fichier principal
Vignette du fichier
447449_1_En_1_Chapter.pdf (271.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01656359 , version 1 (05-12-2017)


Attribution - CC BY 4.0



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⟩
49 View
87 Download



Gmail Facebook Twitter LinkedIn More