Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from
simple local interaction and computation. Since the inception of cellular automaton (CA) by …

This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state
finite cellular automata (CAs) of length n under periodic boundary condition. A tool named …

Motivated by applications such as the spread of epidemics and the propagation of influence
in social networks, we propose a formal model for analyzing the dynamics of such networks …

In this dissertation, we study two of the global properties of 1-dimensional cellular automata
(CAs) under periodic boundary condition, namely, reversibility and randomness. To address …

Concepts from graph theory have been used in the local and global analysis and
characterization of a cellular automaton (CA). In particular, De Bruijn graph, pair graph …

In this dissertation, we study temporally stochasticity in cellular automata and the behavior of
such cellular automata. The work also explores the computational ability of such cellular …

Abstract Cellular Automata and Boolean Networks are generalizations of one another
because algorithms to compute the preimage of cellular automata reveal the underlying …

Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from
simple local interaction and computation. Since the inception of cellular automaton (CA) by …

This thesis studies the potential of solving distributed systems problems by cellular automata
(CAs). A cellular automaton (CA) is defined over a regular grid, each cell of which consists of …

While computing preimages of 1D cellular automata is a well researched and documented
problem, for 2D cellular automata there is less research available. For the 1D problem we …