Neighborhood transformations on graph automata

9 years 8 months ago
Neighborhood transformations on graph automata
Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, and their consequences on the topology of the simulated graph, the speed of the simulation and the memory size of simulating automata in some cases. As an example, we apply these transformations to graph automata embedded on surfaces and we link our results with some simulation results between cellular automata on Cayley graphs.
Bruno Martin, Christophe Papazian
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where JAC
Authors Bruno Martin, Christophe Papazian
Comments (0)