Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem

Abstract : Understanding how the composition of cellular automata rules can perform predefined computations can contribute to the general notion of emerging computing by means of locally processing components. In this context, a solution has been recently proposed to the Modulo-n Problem, which is the determination of whether the number of 1-bits in a binary string is perfectly divisible by the positive integer n. Here, we show how to optimise that solution in terms of a reduction of the number of rules required, by means of a merging operation involving of the rules´ active state transitions. The potential for a more general usage of the merging operation is also addressed.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, January 20, 2017 - 4:09:19 PM
Last modification on : Monday, January 23, 2017 - 11:41:25 AM
Long-term archiving on: : Friday, April 21, 2017 - 3:40:27 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Claudio M. Martins, Pedro De Oliveira. Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.196-209, ⟨10.1007/978-3-662-47221-7_15⟩. ⟨hal-01442473⟩



Record views


Files downloads