Oscillating Behaviors on Graph-rewriting Automata
Proceeding: The Second International Conference on Informatics Engineering & Information Science (ICIEIS)Publication Date: 2013-11-12
Authors : Kohji Tomita; Akiya Kamimura; Haruhisa Kurokawa;
Page : 329-333
Keywords : Graph Rewriting; Graph Automata; Oscillator; Emer-gence.;
Abstract
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.
Other Latest Articles
- Critical Factors Influencing the Registration of Domain Name
- Measurements of Distances from Compound Projection for GIS
- The Challenges in Implementing Risk Management for Information Technology Projects
- An Interactive Webbased Expert System Degree Planner
- Simple Scheduling Scheme for Smart Home and Ambient Assisted Living
Last modified: 2013-11-14 22:52:17