Cellular automata are simple models of computation which exhibit fascinatingly complex
behavior. They have captured the attention of several generations of researchers, leading to …

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 …

Abstract In recent years, Cellular Automata (CA) have been found as an attractive modeling
tool for various applications, such as, pattern recognition, image processing, data …

On Nori’s Fundamental Group Scheme Page 1 Progress in Mathematics, Vol. 265, 377–398
c© 2007 Birkhäuser Verlag Basel/Switzerland On Nori’s Fundamental Group Scheme Hél`ene …

Abstract Study of Cellular Automata (CA) as a modeling tool has received considerable
attention in recent years. Researchers from diverse fields-image processing, language …

A σ-automaton is an additive, binary cellular automaton on a graph. For product graphs such
as a grids and cylinders, reversibility and periodicity properties of the corresponding σ …

Using number theory on function fields and algebraic number fields, we prove results about
Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional …

Let T be a tree with ℓ leaves. Each vertex of T is assigned a state either lit or off. An
assignment of states to all the vertices of T is called a configuration. The lit-only σ-game …

This paper delves into the expansive world of cellular automata (CA), abstract models of
computation comprised of cells that interact based on predefined rules. Originating from …

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 …