Rulse sets and movies of graph automata

1. Flexible resolution [rule] [movie(avi)] [movie(rm)]

  regular expansion
 

2. Limit cycle on a closed surface [rule] [movie(avi)] [movie(rm)]
limit cyle 1 <->limit cyle 2

3. Generation of hierarchy [rule] [movie(avi)] [movie(rm)]
generation of hierarchy

4. Minimal self-replication [rule] [movie(avi)] [movie(rm)]
minimal self-replication  
 
5. Reproduction of Turing machine [rule] [rule schema] [movie(avi)] [movie(rm)]
self-replicating Turing machine  
 
Reference:
Kohji Tomita, Haruhisa Kurokawa and Satoshi Murata:
Graph Automata: Natural Expression of Self-Reproduction,
Physica D, Vol. 171, No. 4, pp. 197-210, 2002.

[back to Home]