Oscillating Behaviors on Graph-rewriting Automata

We consider a class of connected planar 3-regular graphs (rotation systems) with states on each node, and their dynamical behaviors based on three structurally rewriting rules. In this paper, we focus on oscillating behavior on the framework, and two kinds of oscillation by structural rewriting and coupled oscillators are considered. Such behavior would be important for analyzing or designing self-organizing systems.