On the invertible cellular automata 150 over Fp

作者:

Highlights:

摘要

In this work the reversibility problem for cellular automata with rule number 150 over the finite field Fp is tackled. It is shown that when null boundary conditions are stated, the reversibility is independent of the state set Fp 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.

论文关键词:Reversibility,Cellular automata,Rule 150,DETGTRI algorithm,Null boundary conditions

论文评审过程:Available online 20 December 2012.

论文官网地址:https://doi.org/10.1016/j.amc.2012.11.036