Detail publikace

Evolution of Cellular Automata with Conditionally Matching Rules

Originální název

Evolution of Cellular Automata with Conditionally Matching Rules

Anglický název

Evolution of Cellular Automata with Conditionally Matching Rules

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT103434,
  author="Michal {Bidlo} and Zdeněk {Vašíček}",
  title="Evolution of Cellular Automata with Conditionally Matching Rules",
  annote="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.",
  address="IEEE Computer Society",
  booktitle="2013 IEEE Congress on Evolutionary Computation (CEC 2013)",
  chapter="103434",
  doi="10.1109/CEC.2013.6557699",
  edition="NEUVEDEN",
  howpublished="online",
  institution="IEEE Computer Society",
  year="2013",
  month="june",
  pages="1178--1185",
  publisher="IEEE Computer Society",
  type="conference paper"
}