DENNUNZIO , Alberto

In this paper we study some decidable properties of twodimensional cellular automata (2D CA). The notion of closingness is generalized to the 2D case and it is linked to permutivity and openness. The major contributions of this work are two deep constructions which have been fundamental in order to prove our new results and we strongly believe...

International audience

International audience

International audience

International audience

This special issue contains four papers presented during theworkshop, ''18th International Workshop on CellularAutomata and Discrete Complex Systems'' (Automata2012), held in La Marana, Corsica island (France) in theperiod September 19–21th, 2012.The aim of this workshop is to establish and maintain apermanent, international, multidisciplinary...

International audience

The paper deals with recent developments about non-uniform cellular automata. After reviewing known results about structural stability we complete them by showing that also sensitivity to initial conditions is not structurally stable. The second part of the paper reports the complexity results about the main dy-namical properties. Some proofs...

Extremal combinatorics is the study of the size that a collection of objects must have in order to certainly satisfy a given property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behavior of large reaction systems by means of extremal...

Extremal combinatorics is the study of the size that a certain collection of objects must have in order to certainly satisfy a property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behaviour of large reaction systems by means of extremal...

A combinatorial proof that surjective D-dimensional CA are non-wandering is given. This answers an old open question stated in Blanchard and Tisseur (2000) [3]. Moreover, an explicit upper bound for the return time is given.

International audience

We present recent studies on cellular automata (CAs) viewed as discrete dynamical systems. In the first part, we illustrate the relations between two important notions: subshift attractors and signal subshifts, measure attractors and particle weight functions. The second part of the chapter considers some operations on the space of...

This paper investigates a variant of cellular automata, namely ν-CA. Indeed, ν-CA are cellular automata which can have dierent local rules at each site of their lattice. The assignment of local rules to sites of the lattice completely characterizes ν-CA. In this paper, sets of assignments sharing some interesting properties are associated with...

This special issue contains four papers presented during the workshop "2nd International Workshop on Asynchronous Cellular Automata and Asynchronous Discrete Models" (ACA 2012), held at the 10th International Conference on Cellular Automata for Research and Industry (ACRI 2012) in Santorini Island (Greece) in the period September 24th-27th, 2012.

This special issue contains four papers presented during the workshop "2nd International Workshop on Asynchronous Cellular Automata and Asynchronous Discrete Models" (ACA 2012), held at the 10th International Conference on Cellular Automata for Research and Industry (ACRI 2012) in Santorini Island (Greece) in the period September 24th-27th, 2012.

International audience

The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjec-tivity and injectivity is also established. The final part studies a strong form of equicontinuity property...

In this paper we study the dynamics of D-dimensional cellular automata (CA) by considering them as one-dimensional (1D) CA along some direction (slicing constructions). These constructions allow to give the D-dimensional version of important notions as 1D closing property and lift well-known one-dimensional results to the D-dimensional...

We consider the family of all the Cellular Automata (CA) sharing the same local rule but have different memory. This family contains also all the CA with memory m 0 (one-sided CA) which can act both on AZ and on AN. We study several set theoretical and topological properties for these classes. In particular we investigate if the properties of a...

The standard cellular automata (CA) model is based on three main features: locality, uniformity and synchronicity. Recently, some variants have been introduced, most of them consist in relaxing one of those three properties. In this paper, we study the dynamical behavior of m-ACA (using fair measures), a variant of cellular automata in which...

This paper investigates acceptance conditions for nite au-tomata recognizing ω-regular languages. Their expressive power and their position w.r.t. the Borel hierarchy is also studied. The full characterization for the conditions (ninf,), (ninf, ⊆) and (ninf, =) is given. The nal section provides a partial characterization of (f in, =).

ν-CA are cellular automata which can have different local rules at each site of their lattice. Indeed, the spatial distribution of local rules completely characterizes ν-CA. In this paper, sets of distributions sharing some interesting properties are associated with languages of bi-infinite words. The complexity classes of these languages are...

This work considers a cellular automaton (CA) with two particles: a stationary particle $1$ and left-going one $\overline{1}$. When a $\overline{1}$ encounters a $1$, both particles annihilate. We derive asymptotic distribution of appearence of particles at a given site when the CA is initialized with the Bernoulli measure with the...

This work studies some aspects of the computational power of fully asynchronous cellular automata (ACA). We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences specifying which are "universal", i.e., allowing a (specific family of) ACA to simulate any Turing machine on any...