Detail publikace

On Routine Evolution of New Replicating Structures in Cellular Automata

Originální název

On Routine Evolution of New Replicating Structures in Cellular Automata

Anglický název

On Routine Evolution of New Replicating Structures in Cellular Automata

Jazyk

en

Originální abstrakt

This paper presents evolutionary design of two-dimensional, uniform cellular automata. The problem of replicating loops is considered as a case study. Conditionally matching rules are used as a technique that is suitable to the design of cellular automata state transition rules. A genetic algorithm is applied to the design of cellular automata that satisfy the requirements of replicating loops. It is shown that such evolution is able to find various state transition rules that support replication of a given loop. Results presented herein demonstrate the ability of derived cellular automata to perform replication not only from an initial instance of the loop but also, that from a seed the loop can autonomously grow.

Anglický abstrakt

This paper presents evolutionary design of two-dimensional, uniform cellular automata. The problem of replicating loops is considered as a case study. Conditionally matching rules are used as a technique that is suitable to the design of cellular automata state transition rules. A genetic algorithm is applied to the design of cellular automata that satisfy the requirements of replicating loops. It is shown that such evolution is able to find various state transition rules that support replication of a given loop. Results presented herein demonstrate the ability of derived cellular automata to perform replication not only from an initial instance of the loop but also, that from a seed the loop can autonomously grow.

BibTex


@inproceedings{BUT119826,
  author="Michal {Bidlo}",
  title="On Routine Evolution of New Replicating Structures in Cellular Automata",
  annote="This paper presents evolutionary design of two-dimensional, uniform cellular
automata. The problem of replicating loops is considered as a case study.
Conditionally matching rules are used as a technique that is suitable to the
design of cellular automata state transition rules. A genetic algorithm is
applied to the design of cellular automata that satisfy the requirements of
replicating loops. It is shown that such evolution is able to find various state
transition rules that support replication of a given loop. Results presented
herein demonstrate the ability of derived cellular automata to perform
replication not only from an initial instance of the loop but also, that from
a seed the loop can autonomously grow.",
  address="SciTePress - Science and Technology Publications",
  booktitle="7th International Conference on Evolutionary Computationa Theory and Applications",
  chapter="119826",
  doi="10.5220/0005585000280038",
  edition="7th International Joint Conference on Computational Intelligence",
  howpublished="electronic, physical medium",
  institution="SciTePress - Science and Technology Publications",
  year="2015",
  month="november",
  pages="28--38",
  publisher="SciTePress - Science and Technology Publications",
  type="conference paper"
}