An evolutionary approach to the identification of Cellular Automata based on partial observations

08/24/2015
by   Witold Bołt, et al.
0

In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the system at certain, unknown time steps. A solution method based on a modified variant of a Genetic Algorithm (GA) is proposed and illustrated with brief experimental results.

READ FULL TEXT

page 2

page 6

research
05/13/2020

Using Genetic Algorithm To Evolve Cellular Automata In Performing Edge Detection

Cellular automata are discrete and computational models thatcan be shown...
research
04/03/2023

On the Garden of Eden theorem for non-uniform cellular automata

We establish several extensions of the well-known Garden of Eden theorem...
research
02/21/2022

Generating Hard Problems of Cellular Automata

We propose two hard problems in cellular automata. In particular the pro...
research
05/22/2023

Self-Replication, Spontaneous Mutations, and Exponential Genetic Drift in Neural Cellular Automata

This paper reports on patterns exhibiting self-replication with spontane...
research
09/08/2019

Evolving Order and Chaos: Comparing Particle Swarm Optimization and Genetic Algorithms for Global Coordination of Cellular Automata

We apply two evolutionary search algorithms: Particle Swarm Optimization...
research
05/25/2021

Evolutionary Algorithms for Designing Reversible Cellular Automata

Reversible Cellular Automata (RCA) are a particular kind of shift-invari...
research
04/15/2020

Latin Hypercubes and Cellular Automata

Latin squares and hypercubes are combinatorial designs with several appl...

Please sign up or login with your details

Forgot password? Click here to reset