Publication detail

Evolution of Cellular Automata with Conditionally Matching Rules

BIDLO, M. VAŠÍČEK, Z.

Original Title

Evolution of Cellular Automata with Conditionally Matching Rules

Type

conference paper

Language

English

Original Abstract

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.

Keywords

Evolutionary algorithm, cellular automaton, conditional rule, replication, pattern transformation

Authors

BIDLO, M.; VAŠÍČEK, Z.

RIV year

2013

Released

25. 6. 2013

Publisher

IEEE Computer Society

Location

Cancún

ISBN

978-1-4799-0452-5

Book

2013 IEEE Congress on Evolutionary Computation (CEC 2013)

Pages from

1178

Pages to

1185

Pages count

8

URL

http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6557699

BibTex

@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"
}