One-Dimensional Cellular Automata with Reflective Boundary Conditions and Radius Three

A family of one-dimensional finite linear cellular automata with reflective boundary condition over the field $Z_p$ is defined. The generalizations are the radius and the field that states take values. Here, we establish a connection between reversibility of cellular automata and the rule matrix of the cellular automata with radius three. Also, we prove that the reverse CA of this family again falls into this family

On Pseudo Random Bit Generators via Two-Dimensional Hybrid Cellular Automata

In this work, we study the structure of two-dimensional linear hybrid cellular automata with respect to adiabatic boundary condition. Further, we check the performance of hybrid cellular automata constructed through the members of this family in generating pseudo random bits

2-Dimensional Reversible Hexagonal Cellular Automata with Periodic Boundary

In this paper, we study 2-dimensional finite cellular automata defined by hexagonal local rule with periodic boundary over the field $Z_3$. We construct the rule matrix corresponding to the hexagonal cellular automata. For some given coefficients and the number of columns of hexagonal information matrix, we prove that the hexagonal cellular automata are reversible

2D Cellular Automata with an Image Processing Application

This paper investigates the theoretical aspects of two-dimensional linear cellular automata with image applications. We consider geometrical and visual aspects of patterns generated by cellular automata evolution. The present work focuses on the theory of two-dimensional linear cellular automata with respect to uniform periodic and adiabatic boundary cellular automata conditions. Multiple copies of any arbitrary image corresponding to cellular automata find so many applications in real life situation e.g. textile design, DNA genetics research, etc