A study on learning robustness using asynchronous 1D cellular automata rules

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


Numerous studies can be found in literature concerning the idea of learning cellular automata (CA) rules that perform a given task by means of machine learning methods. Among these methods, genetic algorithms (GAs) have often been used with excellent results. Nevertheless, few attention has been dedicated so far to the generality and robustness of the learned rules. In this paper, we show that when GAs are used to evolve asynchronous one-dimensional CA rules, they are able to find more general and robust solutions compared to the more usual case of evolving synchronous CA rules.
Original languageUnknown
Pages (from-to)289-302
JournalNatural Computing
Issue number2
Publication statusPublished - 1 Jan 2012

Cite this