Reversibility of One-Dimensional Cellular Automata

In this paper, we study one dimensional finite linear cellular automata. We obtained the representative matrix with the help of local rules under the null boundary condition. We have defined an algorithm that gives whether these obtained matrices have an inverse on finite fields under what conditions. This also gives us an idea of the reversibility of the cellular automata family. Finally, we give some examples of these families of cellular automata.