Discovering the rules of a elementary one-dimensional automaton

Authors:
Erinaldo L. Siqueira Júnior;Tiago A. E. Ferreira;Marcelo G. da Silva
Affiliations:
Universidade Federal Rural de Pernambuco - UFRPE, Recife, PE, Brazil;Universidade Federal Rural de Pernambuco - UFRPE, Recife, PE, Brazil;Universidade Federal Rural de Pernambuco - UFRPE, Recife, PE, Brazil
Venue:
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Year:
2012

Citing 7
Cited 0

A new kind of science

A new kind of science
Theory and application of cellular automata for pattern classification

Fundamenta Informaticae - Special issue on cellular automata
Cellular automata and communication complexity

Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
Dynamic Neighbourhood Cellular Automata1

The Computer Journal
A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance

IEEE Transactions on Evolutionary Computation
A study on learning robustness using asynchronous 1D cellular automata rules

Natural Computing: an international journal
On Cellular Automata rules of molecular arrays

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present a way to find the set of rules for the evolution of a one-dimensional cellular automata through its window of evolution using genetic algorithm, a search routine that mimics the behavior of the genetic evolution of living beings. As a result, we present the rules obtained by this strategy to the windows of the development of elementary automata rule 110 presented by Stephen Wolfram.