Automatic generation of self-replicating patterns in graph automata

Kohji Tomita, Haruhisa Kurokawa, Satoshi Murata

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Graph automata define symbol dynamics of graph structures, which are capable of generating structures in addition to describing state transition. Rules of the graph automata are uniform and are therefore suitable for evolutionary computation. This paper shows that various self-replications are possible in graph automata, and that evolutionary computation is applicable to automatic rule generation to obtain self-replicating patterns of graph automata.

Original languageEnglish
Pages (from-to)1011-1018
Number of pages8
JournalInternational Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Issue number4
Publication statusPublished - 2006


  • Cellular automata
  • Evolutionary computation
  • Graph automata
  • Self-replication


Dive into the research topics of 'Automatic generation of self-replicating patterns in graph automata'. Together they form a unique fingerprint.

Cite this