Evolution of Cellular Automata Development Using Various Representations

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU132973" target="_blank" >RIV/00216305:26230/19:PU132973 - isvavai.cz</a>

Výsledek na webu

<a href="https://dl.acm.org/citation.cfm?id=3321881" target="_blank" >https://dl.acm.org/citation.cfm?id=3321881</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3319619.3321881" target="_blank" >10.1145/3319619.3321881</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Evolution of Cellular Automata Development Using Various Representations

Popis výsledku v původním jazyce

This paper introduces a comparative summary regarding evolution of multistate cellular automata by means of various representations of transition functions. In particular, a conventional table-based representation and an advanced approach using Conditionally Matching Rules is applied. The French flag development from a seed is considered as a case study task. The results show some remarkable differences in the cellular automata behaviour which is evidently caused by the representation used. This includes the issue of emergence of the pattern from chaotic state or rather its systematic construction, stability of the pattern and limitation of its successful development to fixed-size automata only. The comparison of these results is enabled by using a custom variant of genetic algorithm that provides working solutions of this task using both representations of the transition function.

Název v anglickém jazyce

Evolution of Cellular Automata Development Using Various Representations

Popis výsledku anglicky

This paper introduces a comparative summary regarding evolution of multistate cellular automata by means of various representations of transition functions. In particular, a conventional table-based representation and an advanced approach using Conditionally Matching Rules is applied. The French flag development from a seed is considered as a case study task. The results show some remarkable differences in the cellular automata behaviour which is evidently caused by the representation used. This includes the issue of emergence of the pattern from chaotic state or rather its systematic construction, stability of the pattern and limitation of its successful development to fixed-size automata only. The comparison of these results is enabled by using a custom variant of genetic algorithm that provides working solutions of this task using both representations of the transition function.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LTC18053" target="_blank" >LTC18053: Pokročilé metody Nature-Inspired optimalizačních algoritmů a HPC implementace pro řešení reálných aplikací</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

GECCO '19 Proceedings of the Genetic and Evolutionary Computation Conference Companion

ISBN

978-1-4503-6748-6

ISSN

—

e-ISSN

—

Počet stran výsledku

2

Strana od-do

107-108

Název nakladatele

Association for Computing Machinery

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

13. 7. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000538328100054