Back to Search
Start Over
Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions.
- Source :
-
Theoretical Computer Science . Oct2024, Vol. 1012, pN.PAG-N.PAG. 1p. - Publication Year :
- 2024
-
Abstract
- Reversibility is one of the most significant properties of cellular automata (CA). In this paper, we focus on the reversibility of one-dimensional finite CA under reflective boundary conditions (RBC). We present two algorithms for deciding the reversibility of one-dimensional CA under RBC. Both algorithms work for not only linear rules but also non-linear rules. The first algorithm is to determine what we call the "strict reversibility" of CA. The second algorithm is to compute what we call the "reversibility function" of CA. Reversibility functions are proved to be periodic. Based on the algorithms, we list some experiment results of one-dimensional CA under RBC and analyse some features of this family of CA. [ABSTRACT FROM AUTHOR]
- Subjects :
- *CELLULAR automata
*ALGORITHMS
*DECISION making
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 1012
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 179261182
- Full Text :
- https://doi.org/10.1016/j.tcs.2024.114732