Mora, J. C., Vergara, S. V., Martinez, G. J. and McIntosh, H. V.
Procedures for calculating reversible one-dimensional cellular automata.
Physica D: Nonlinear Phenomena, 202 (1-2).
- Accepted Version
Publisher's URL: http://dx.doi.org/10.1016/j.physd.2005.01.018
Two algorithms for calculating reversible one-dimensional cellular automata of neighborhood size 2 are presented. It is explained how this kind of automata represents all the rest. Using two basic properties of these systems such as the uniform multiplicity of ancestors and Welch indices, these algorithms only require matrix products and the transitive closure of binary relations to yield the calculation of reversible automata. The features, advantages and differences of these algorithms are described and results for reversible automata of 3, 4, 5 and 6 states are comprised.
|Uncontrolled Keywords:||cellular automata, welch theory, algorithms|
|Faculty/Department:||Faculty of Environment and Technology|
|Deposited On:||02 Jun 2010 15:46|
|Last Modified:||13 Aug 2013 11:42|
Request a change to this item
Total Document Downloads in Past 12 Months