Abstract
We consider a variant of graph developing system and show various behavior with one type of graph-rewriting. This system is based on rewriting of 3-regular graphs with two possible states per node. We focus on a simple case of fixed number of nodes. The development processes include interaction among rather stable subgraphs. Some simple behaviors, such as clustering and declustering of states, are shown by simulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Greenlaw, R., Petreschi, R.: Cubic graphs. ACM Computing Surveys 27(4), 471–495 (1995)
Gross, T., Sayama, H. (eds.): Adaptive Networks: Theory, Models and Applications. Springer (2009)
Rozenberg, R. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. 1. World Scientific (1997)
Tomita, K., Kurokawa, H., Murata, S.: Graph Automata: Natural Expression of Self-Reproduction. Physica D 171(4), 197–210 (2002)
Tomita, K., Murata, S., Kurokawa, H.: Self-description for construction and computation on graph-rewriting automata. Artificial Life 13(4), 383–396 (2007)
von Neumann, J.: Theory of Self-Reproducing Automata. Univ. of Illinois Press (1966)
Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Tomita, K., Kurokawa, H. (2012). State Clustering and Declustering of 3-Regular Graphs with Structural Rewriting. In: Suzuki, J., Nakano, T. (eds) Bio-Inspired Models of Network, Information, and Computing Systems. BIONETICS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32615-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-32615-8_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32614-1
Online ISBN: 978-3-642-32615-8
eBook Packages: Computer ScienceComputer Science (R0)