Characterization of 2D Hybrid Cellular Automata with Periodic Boundary

Abstract

We investigate main theoretical aspects of two-dimensional linear-hybrid cellular automata with periodic boundary condition over the Galois field GF(2). We focus on the characterization of two-dimensional hybrid linear cellular automata by way of a special algorithm. Here we set up a relation between reversibility of cellular automata and characterization of two-dimensional hybrid linear cellular automata with a special boundary conditions, i.e. periodic case. The determination of the characterization problem of special type of cellular automaton is studied by means of the matrix algebra theory. It is believed that this type of cellular automata could find many different applications in special case situations, e.g. image processing area, textile design, video processing, DNA research, etc., in the near future.

Reversibility Algorithm for 2D Cellular Automata with Reflective Condition

“…New other results is another goal of the future study. These CA results can be applied successfully in especially image processing area [9][10][11][12][13] and the other science branches in near future [14][15][16][17][18][19][20][21].…”