Abstract
A cellular automaton (CA) is reversible if it repeats its configuration in a cycle. Reversible one-dimensional CA are studied as automorphisms of the shift dynamical system, and analyses using graph-theoretical approaches and with block permutations. Reversible CA are dynamical systems which conserve their initial information. This is why they pose a particular interest in mathematics, coding and cryptography.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Mora, J.C.S.T., Romero, N.H., Marin, J.M. (2016). Reversibility, Simulation and Dynamical Behaviour. In: Adamatzky, A., MartÃnez, G. (eds) Designing Beauty: The Art of Cellular Automata. Emergence, Complexity and Computation, vol 20. Springer, Cham. https://doi.org/10.1007/978-3-319-27270-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-27270-2_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27269-6
Online ISBN: 978-3-319-27270-2
eBook Packages: EngineeringEngineering (R0)