2012/04/18 by Birendra Kumar Nayak, Nayak, Birendra Kumar, Sudhakar Sahoo +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Advanced Data Storage Technologies #Cellular Automata and Applications #Cellular Automata and Lattice Gases (nlin.CG) #DNA and Biological Computing #Dynamical Systems (math.DS) #FOS: Mathematics #FOS: Physical sciences
paper · pdf · doi:10.48550/arxiv.1204.3999
openalex publication_date 2012/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are defined as linear numbers and the properties of these linear numbers are studied.