Non Uniform Cellular Automata Description of Signed Partition Versions of Ice and Sand Pile Models

Abstract

International audienceThis paper reviews the well-known formalisations for ice and sand piles, based on a finite sequence of non-negative integers and its recent extension to signed partitions, i.e. sequences of a non-negative and a non-positive part of integers, both non increasing.The ice pile model can be interpreted as a discrete time dynamical system under the action of a vertical and a horizontal evolution rule, whereas the sand pile model is characterized by the unique action of the vertical rule.The signed partition extension, besides these two dynamical evolution rules, also takes into account an annihilation rule at the boundary region between the non-negative and the non-positive regions. We provide an original physical interpretation of this model as a p-n junction of two semiconductors.Moreover, we show how the sand pile extension of the signed partition environment can be formalized by mean of a non-uniform cellular automaton (CA) since the vertical and the annihilation evolution rules have the formal description of two CA local rules. Finally, we provide a similar construction for the ice pile extension

Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems

“…Network models are the natural way to formalize the evolution of any phenomenon that includes cells, gens, entities, or any kind of distinct elements which interact among them. Thus, it is not amazing the big amount of papers, published in the last decades, associated with sciences (see, for instance, [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18]) and engineering (see, for instance, [19][20][21][22][23][24]), where such models appear to represent different phenomena and study their behavior.…”

How Hard is it to Predict Sandpiles on Lattices? A Survey

“…al. started to formalize the intuitive notion of "complexity" of a system, through the computational complexity of predicting the behaviour of the system [41,48,49,50,55,56] (for other kinds of complexity in dynamical systems, see for instance [17,18,20,1,16,11,10,19]). Computational complexity theory is actually a perfect fit to capture the complexity of systems able to compute.…”

Rough Sets for n-Cycles and n-Paths

“…Recently, the impetuous development of computer science has placed new questions about the graph structures. For example, the graphs can be studied in terms of sequential dynamical systems (see [2,3,4,5]), by means of parallel dynamics (see [1]), or also for their analogies with both sequential and parallel dynamics on order structures (see [7,8,9,10,15,17,18,19,20,21]). In this paper we continue a research project started in [22,23], where a simple undirected graph is studied as a particular type of information system.…”