Reversibility of linear cellular automata

作者:

Highlights:

摘要

In this paper the reversibility problem for linear cellular automata defined by a characteristic matrix of the form of a pentadiagonal matrix is tackled. Specifically, a criterion for the reversibility in terms of the number of cells is stated and, in these cases, the inverse cellular automata are explicitly computed.

论文关键词:Cellular automata,Linear transition function,Reversibility,Pentadiagonal matrices,Matrix theory

论文评审过程:Available online 21 March 2011.

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