Abstract
An effort to study one-dimensional nonuniform elementary number conserving cellular automata (NCCA) rules from an exponential order rule space of cellular automata is an excellent computational task. To perform this task effectively, a mathematical heritage under the number of conserving functions over binary strings of length [Formula: see text] has been highlighted along with their number conserving cellular automata rules (either uniform or nonuniform). A basic approach for the construction of some feasible nonuniform NCCA rules of any finite configuration with the assistance of nine uniform elementary CA rules has been investigated. From our construction procedure, recurrence equations are formulated as suitably solved to ascertain the actual range of NCCA rules. The state transition diagrams (STDs) of NCCA rules are analyzed. While classifying the binary strings through STDs, we found a fascinating optical insight that equal weight strings from a class whose cardinality is the same as the binomial coefficient [Formula: see text] where [Formula: see text] is the length and [Formula: see text] is the weight of the binary string.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
