Fast parallel language recognition by cellular automata
Theoretical Computer Science
A simple three-dimensional real-time reliable cellular array
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
A new kind of science
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Artificially Evolved Asynchronous Cellular Automata for the Density Task
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Evolving Cellular Automata as Pattern Classifier
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
Theory and application of cellular automata for pattern classification
Fundamenta Informaticae - Special issue on cellular automata
Large deviations for mean field models of probabilistic cellular automata
Random Structures & Algorithms
A Neuro-Genetic Framework for Pattern Recognition in Complex Systems
Fundamenta Informaticae - Membrane Computing
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
Asynchronous behavior of double-quiescent elementary cellular automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
A study on learning robustness using asynchronous 1D cellular automata rules
Natural Computing: an international journal
Hi-index | 0.00 |
We present a framework based on genetic algorithms to automatically generate cellular automata rules under four different asynchronous update models (fixed random sweep, random new sweep, clock and independent random ordering). We consider four different rules (18, 56, 110 and 180) with well known dynamics under synchronous update scheme. We try to reconstruct the same dynamics by means of a genetic algorithm using asynchronous update schemes. We show that in many cases it is impossible, by means of an asynchronous update scheme, to perfectly reconstruct these dynamics. Nevertheless, we show that the genetic algorithm finds the rules that more closely approximate the target behavior and the dynamics of the rules found by the genetic algorithm are rather similar to the target ones. In particular, we can always recognize a similar patter and we can also identify some differences in small details, which can be minimal (as for rule 18) or rather visible (as for rule 110). This paves the way to a deeper investigation on this track: does using asynchronous updates allow us to find more stable rules, i.e. rules that are less affected by noise, and thus do not overfit training data? This question remains open and answering it is one of the main goals of our current research.