27 citations · 37 across the 15 of their papers we have counts for
6 papers · 1 filter
Topological transitivity of group cellular automata is decidable
Niccolò Castronuovo, Alberto Dennunzio, Luciano Margara
Topological transitivity is a fundamental notion in topological dynamics and is widely regarded as a basic indicator of global dynamical complexity. For general cellular automata,…
Decidability and Characterization of Expansivity for Group Cellular Automata
Niccolo' Castronuovo, Alberto Dennunzio, Luciano Margara
Group cellular automata are continuous, shift-commuting endomorphisms of , where is a finite group. We provide an easy-to-check characterization of expansivity fo…
A Divide and Conquer Algorithm for Deciding Group Cellular Automata Dynamics
Niccolo' Castronuovo, Alberto Dennunzio, Luciano Margara
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including su…
An Easily Checkable Algebraic Characterization of Positive Expansivity for Additive Cellular Automata over a Finite Abelian Group
Alberto Dennunzio, Enrico Formenti, Luciano Margara
We provide an easily checkable algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. First of all, an easily checkable char…
On the dynamical behaviour of linear higher-order cellular automata and its decidability
Alberto Dennunzio, Enrico Formenti, Luca Manzoni +2
Higher-order cellular automata (HOCA) are a variant of cellular automata (CA) used in many applications (ranging, for instance, from the design of secret sharing schemes to data co…
Strictly Temporally Periodic Points in Cellular Automata
Alberto Dennunzio, Pietro Di Lena, Luciano Margara
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not…