2016/04/22 by Raju Hazari, Hazari, Raju, Sukanta Das +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Data Storage Technologies #Cellular Automata and Applications #DNA and Biological Computing #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
paper · pdf · doi:10.48550/arxiv.1604.06600
openalex publication_date 2016/04/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 n cells is number conserving or not. Finally, a synthesis scheme is developed to get an n-cell number conserving non-uniform CA.