activity
20092026
most citedOn the dynamical behaviour of linear higher-order cellular automata and its decidability

27 citations · 37 across the 15 of their papers we have counts for

collaborators

16 papers

cs.FL2026

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,…

cs.FL2025

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…

cs.FL2025

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…

cs.DM2025

Structural Properties of Non-Linear Cellular Automata: Permutivity, Surjectivity and Reversibility

Firas Ben Ramdhane, Alberto Dennunzio, Luciano Margara +1

This paper explores the algebraic conditions under which a cellular automaton with a non-linear local rule exhibits surjectivity and reversibility. We also analyze the role of perm…

cs.DM2024★ 3 cited

On solving basic equations over the semiring of functional digraphs

Alberto Dennunzio, Enrico Formenti, Luciano Margara +1

Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commu…

cs.FL2023

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…