Figure 5 - uploaded by Luca Mariot
Content may be subject to copyright.
A locally invertible CA defined by the single landscape 0 10. Figure 5b displays an example of a cycle starting from the initial state 011001. The two cells in blue are in the landscape 0 10.

A locally invertible CA defined by the single landscape 0 10. Figure 5b displays an example of a cycle starting from the initial state 011001. The two cells in blue are in the landscape 0 10.

Source publication
Preprint
Full-text available
Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by a dynamics composed only of disjoint cycles. They have many applications in the simulation of physical systems, cryptography and reversible computing. In this work, we formulate the search of a specific class of RCA -- namely, those whose lo...

Contexts in source publication

Context 1
... 1 Let d = 4 and ω = 1, and let f : F 4 2 → F 2 be the local rule defined by the single landscape L = 010. The tabulation depicted in Figure 5a shows that all three landscapes of the neighboring cells are incompatible with L. In particular, when x i is in landscape L, then: ...
Context 2
... 1 Let d = 4 and ω = 1, and let f : F 4 2 → F 2 be the local rule defined by the single landscape L = 010. The tabulation depicted in Figure 5a shows that all three landscapes of the neighboring cells are incompatible with L. In particular, when x i is in landscape L, then: ...

Similar publications

Article
Full-text available
Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by dynamics composed only of disjoint cycles. They have many applications in the simulation of physical systems, cryptography, and reversible computing. In this work, we formulate the search of a specific class of RCA – namely, those whose loca...