A study on learning robustness using asynchronous 1D cellular automata rules
From MaRDI portal
Recommendations
- An experimental study of robustness to asynchronism for elementary cellular automata
- Probing robustness of cellular automata through variations of asynchronous updating
- Asynchronous cellular learning automata
- Robustness of cellular automata in the light of asynchronous information transmission
- Evolving robust asynchronous cellular automata for the density task
- A MATHEMATICAL FRAMEWORK FOR CELLULAR LEARNING AUTOMATA
- OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA
- A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- scientific article; zbMATH DE number 2016492
Cites work
- A simple three-dimensional real-time reliable cellular array
- A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms
- An experimental study of robustness to asynchronism for elementary cellular automata
- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
- Cellular Automata Modeling of Physical Systems
- Co-evolving non-uniform cellular automata to perform computations
- Fast parallel language recognition by cellular automata
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 5508844 (Why is no real title available?)
- scientific article; zbMATH DE number 3688721 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 2016492 (Why is no real title available?)
- scientific article; zbMATH DE number 2016493 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Large deviations for mean field models of probabilistic cellular automata
- Mathematical Foundations of Computer Science 2005
- Probabilistic cellular automata with conserved quantities
- Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority
- Real-time language recognition by one-dimensional cellular automata
- Reliable cellular automata with self-organization
- Reliable computation with cellular automata
- Robustness of cellular automata in the light of asynchronous information transmission
- Synchronous versus asynchronous dynamics in spatially distributed systems
Cited in
(3)
This page was built for publication: A study on learning robustness using asynchronous 1D cellular automata rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629939)