Abstract
Some real world phenomena are essentially two dimensional; they are more naturally modelled by map grammars than graph grammars. The planarity of maps can be captured by cycles and converted into a form suitable for abstract manipulation. This insight suggests (section 1) a new definition of map grammars, (section 2) some theorems, (section 3) and a generalization of the algebraic approach to graph grammars.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Numbered References
K. Culik & J. Opatrny: Context in Parallel Rewriting, Springer Lecture Notes 15(1974) 230–243.
A. Lindenmayer: Mathematical models for cellular interaction in development, J. Theor. Biology 18(1968) 280–315.
S. Maciane: A combinatorial condition for planar graphs, Fund. Math. 28(1937) 22–32.
W.T. Tutte: Convex representation of graphs, Proc. London Math. Soc. 10(1960) 304–320.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyrup, K., Mayoh, B. (1979). Map grammars: Cycles and the algebraic approach. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025730
Download citation
DOI: https://doi.org/10.1007/BFb0025730
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09525-5
Online ISBN: 978-3-540-35091-0
eBook Packages: Springer Book Archive