2019
DOI: 10.1088/1742-5468/ab25df
|View full text |Cite
|
Sign up to set email alerts
|

A two-layer representation of four-state reversible number-conserving 2D cellular automata

Abstract: We present a novel representation of 1D reversible and numberconserving cellular automata with four states. Carrying this view over to two dimensions, we are able to construct 65 four-state reversible and numberconserving 2D cellular automata with the von Neumann neighborhood. A clever use of the split-and-perturb decomposition of number-conserving CAs allows to prove by elimination that this list is complete.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
3
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 11 publications
(39 reference statements)
1
3
0
Order By: Relevance
“…However, for k = 3 and k = 4, we do not need to check the reversibility of the obtained local rules. Indeed, as we mentioned before, we found only three ternary ones (which are definitely reversible and we know their inverse) and for the quaternary NCCAs, descriptions of all 21 local rules presented in Table 3 were given by Dzedzej et al in [35] and from those descriptions it follows that all are reversible. We emphasize once again that both the results for k = 3 and k = 4 were already known -here we derived them only to illustrate our new method.…”
Section: Verification: Checking Reversibility Of the Obtained Local Rulessupporting
confidence: 67%
See 3 more Smart Citations
“…However, for k = 3 and k = 4, we do not need to check the reversibility of the obtained local rules. Indeed, as we mentioned before, we found only three ternary ones (which are definitely reversible and we know their inverse) and for the quaternary NCCAs, descriptions of all 21 local rules presented in Table 3 were given by Dzedzej et al in [35] and from those descriptions it follows that all are reversible. We emphasize once again that both the results for k = 3 and k = 4 were already known -here we derived them only to illustrate our new method.…”
Section: Verification: Checking Reversibility Of the Obtained Local Rulessupporting
confidence: 67%
“…Moreover, we are convinced that this method can be used for a larger number of states (at least for nine states). We believe that the complete lists of reversible k-ary NCCAs will allow researchers to uncover the structure of these CAs, as was done in the case of quaternary reversible NCCAs by Dzedzej et al [35]. In this way, we hope it will be possible to devise a construction method for reversible NCCAs with an arbitrarily large number of states.…”
Section: K−1}mentioning
confidence: 89%
See 2 more Smart Citations