We provide an efficiently computable characterization of two important properties describing stable and unstable complex behaviours as equicontinuity and sensitivity to the initial conditions for one-dimensional linear cellular automata (LCA) over . We stress that the setting of LCA over with is more expressive, it gives rise to much more complex dynamics, and it is more difficult to deal with than the already investigated case . Indeed, in order to get our result we need to prove a nontrivial result of abstract algebra: if is any finite commutative ring and is any -algebra, then for every pair A, B of matrices over having the same characteristic polynomial, it holds that the set is finite if and only if the set is finite too.

Dennunzio, A., Formenti, E., Grinberg, D., Margara, L. (2021). An efficiently computable characterization of stability and instability for linear cellular automata. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 122(December 2021), 63-71 [10.1016/j.jcss.2021.06.001].

An efficiently computable characterization of stability and instability for linear cellular automata

Dennunzio A
;
2021

Abstract

We provide an efficiently computable characterization of two important properties describing stable and unstable complex behaviours as equicontinuity and sensitivity to the initial conditions for one-dimensional linear cellular automata (LCA) over . We stress that the setting of LCA over with is more expressive, it gives rise to much more complex dynamics, and it is more difficult to deal with than the already investigated case . Indeed, in order to get our result we need to prove a nontrivial result of abstract algebra: if is any finite commutative ring and is any -algebra, then for every pair A, B of matrices over having the same characteristic polynomial, it holds that the set is finite if and only if the set is finite too.
Articolo in rivista - Articolo scientifico
Cellular automata; Complex systems; Decidability; Linear cellular automata;
English
17-giu-2021
2021
122
December 2021
63
71
reserved
Dennunzio, A., Formenti, E., Grinberg, D., Margara, L. (2021). An efficiently computable characterization of stability and instability for linear cellular automata. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 122(December 2021), 63-71 [10.1016/j.jcss.2021.06.001].
File in questo prodotto:
File Dimensione Formato  
Dennunzio-2021-J Comput Syst Sci-VoR.pdf

Solo gestori archivio

Tipologia di allegato: Publisher’s Version (Version of Record, VoR)
Licenza: Tutti i diritti riservati
Dimensione 351.09 kB
Formato Adobe PDF
351.09 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/337039
Citazioni
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 3
Social impact