On Number Conservation of Non-uniform Cellular Automata
Formal Languages and Automata Theory
2016-04-25 v1
Abstract
This paper studies the number conservation property of 1-dimensional non-uniform cellular automata (CAs). In a non-uniform cellular automaton (CA), different cells may follow different rules. The present work considers that the cells follow Wolfram's CAs rules. A characterization tool, named Reachability tree is used to discover the number conservation property of non-uniform CAs. Then a decision algorithm is reported to conclude whether a given non-uniform CA with cells is number conserving or not. Finally, a synthesis scheme is developed to get an -cell number conserving non-uniform CA.
Keywords
Cite
@article{arxiv.1604.06600,
title = {On Number Conservation of Non-uniform Cellular Automata},
author = {Raju Hazari and Sukanta Das},
journal= {arXiv preprint arXiv:1604.06600},
year = {2016}
}