Reversibility of d-State Finite Cellular Automata
Formal Languages and Automata Theory
2018-05-09 v2
Abstract
This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph which represents all possible reachable configurations of an n-cell CA. This tool has been used to test reversibility of CAs. We have identified a large set of reversible CAs using this tool by following some greedy strategies.
Keywords
Cite
@article{arxiv.1502.01187,
title = {Reversibility of d-State Finite Cellular Automata},
author = {Kamalika Bhattacharjee and Sukanta Das},
journal= {arXiv preprint arXiv:1502.01187},
year = {2018}
}
Comments
Copyright of Old City Publishing