Procedures for calculating reversible one-dimensional cellular automata

Mora, J. C., Vergara, S. V., Martinez, G. J. and McIntosh, H. V. (2005) Procedures for calculating reversible one-dimensional cellular automata. Physica D: Nonlinear Phenomena, 202 (1-2). pp. 131-141. ISSN 0167-2789

[img]
Preview
PDF - Accepted Version
149kB

Publisher's URL: http://dx.doi.org/10.1016/j.physd.2005.01.018

Abstract

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.

Item Type:Article
Uncontrolled Keywords:cellular automata, welch theory, algorithms
Faculty/Department:Faculty of Environment and Technology
ID Code:7891
Deposited By: A. Lawson
Deposited On:02 Jun 2010 15:46
Last Modified:03 Jun 2014 04:46

Request a change to this item

Total Document Downloads in Past 12 Months

Document Downloads

Total Document Downloads

More statistics for this item...
Copyright 2013 © UWE better together