%0 Conference Proceedings
%T Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem
%+ Eletrical Engineering and Computing [São Paulo]
%+ Mackenzie Presbyterian University [São Paulo] (UPM)
%A Martins, Claudio, M.
%A Oliveira, Pedro, De
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Turku, Finland
%Y Jarkko Kari
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9099
%P 196-209
%8 2015-06-08
%D 2015
%R 10.1007/978-3-662-47221-7_15
%K Cellular automata
%K Parity problem
%K Active state transitions
%K Modn problem
%K Merging
%K Modulo-n problem
%K Rule composition
%K Emergent computation
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01442473/document
%2 https://inria.hal.science/hal-01442473/file/338243_1_En_15_Chapter.pdf
%L hal-01442473
%U https://inria.hal.science/hal-01442473
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9099
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA