Reversibility of d-State Finite Cellular Automata

Autor:	Bhattacharjee, Kamalika, Das, Sukanta
Rok vydání:	2015
Předmět:	Computer Science - Formal Languages and Automata Theory
Zdroj:	Kamalika Bhattacharjee and Sukanta Das. Reversibility of d-state finite cellular automata. Journal of Cellular Automata, 11(2-3):213-245, 2016
Druh dokumentu:	Working Paper
Popis:	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. Comment: Copyright of Old City Publishing
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1502.01187 Zobrazit plný text záznamu View this record from Arxiv