On the invertible cellular automata 150 over FpFp

In this work the reversibility problem for cellular automata with rule number 150 over the finite field FpFp is tackled. It is shown that when null boundary conditions are stated, the reversibility is independent of the state set FpFp and it appears when the number of cells of the cellular space satisfies some conditions. Furthermore, the explicit expressions of the inverse cellular automata are computed.