A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms

DOI10.1007/978-3-642-15979-4_45zbMath1306.68117OpenAlexW1484928375WikidataQ57518508 ScholiaQ57518508MaRDI QIDQ4931237

Giancarlo Mauri, Andrea Valsecchi, Leonardo Vanneschi

Publication date: 4 October 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15979-4_45

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

A study on learning robustness using asynchronous 1D cellular automata rules ⋮ Effect of asynchronous updating on the stability of cellular automata

Cites Work

• Fast parallel language recognition by cellular automata
• A simple three-dimensional real-time reliable cellular array
• Synchronous versus asynchronous dynamics in spatially distributed systems
• Co-evolving non-uniform cellular automata to perform computations
• Real-time language recognition by one-dimensional cellular automata
• Large deviations for mean field models of probabilistic cellular automata
• Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority
• Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
• Probabilistic cellular automata with conserved quantities
• Cellular Automata Modeling of Physical Systems
• Reliable cellular automata with self-organization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms