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.
Type de document :
Communication dans un congrès
Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Lecture Notes in Computer Science, LNCS-9099, pp.196-209, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_15〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01442473
Contributeur : Hal Ifip <>
Soumis le : vendredi 20 janvier 2017 - 16:09:19
Dernière modification le : lundi 23 janvier 2017 - 11:41:25
Document(s) archivé(s) le : vendredi 21 avril 2017 - 15:40:27

Fichier

338243_1_En_15_Chapter.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Claudio Martins, Pedro Oliveira. Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem. Jarkko Kari. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. Lecture Notes in Computer Science, LNCS-9099, pp.196-209, 2015, Cellular Automata and Discrete Complex Systems. 〈10.1007/978-3-662-47221-7_15〉. 〈hal-01442473〉

Partager

Métriques

Consultations de la notice

11

Téléchargements de fichiers

1