Result Details
Evolution of Cellular Automata with Conditionally Matching Rules
This paper introduces a method of representing transition functions for the purposes of evolutionary design of cellular automata. The proposed approach is based on conditions specified in the transition rules that have to be satisfied in order to determine the next state of a cell according to a specific rule. The goal of this approach is to reduce the number of elements needed to represent a transition function while preserving the possibility to specify traditional transition rules kown from the conventional table-based representation. In order to demonstrate abilities of the proposed approach, the replication problem and pattern transformation problem in cellular automata will be investigated. It will be shown that the evolution is able to design transition functions for non-trivial behavior of two-dimensional cellular automata that perfectly fulfil the specified requirements.
Evolutionary algorithm, cellular automaton, conditional rule, replication, pattern transformation
@inproceedings{BUT103434,
author="Michal {Bidlo} and Zdeněk {Vašíček}",
title="Evolution of Cellular Automata with Conditionally Matching Rules",
booktitle="2013 IEEE Congress on Evolutionary Computation (CEC 2013)",
year="2013",
pages="1178--1185",
publisher="IEEE Computer Society",
address="Cancún",
doi="10.1109/CEC.2013.6557699",
isbn="978-1-4799-0452-5",
url="http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6557699"
}Centrum excelence IT4Innovations, MŠMT, Operační program Výzkum a vývoj pro inovace, ED1.1.00/02.0070, start: 2011-01-01, end: 2015-12-31, completed
Natural Computing on Unconventional Platforms, GACR, Standardní projekty, GAP103/10/1517, start: 2010-01-01, end: 2013-12-31, running