Map grammars: Cycles and the algebraic approach

  • Kristian Nyrup
  • Brian Mayoh
List Of Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 73)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Numbered References

  1. [1]
    K. Culik & J. Opatrny: Context in Parallel Rewriting, Springer Lecture Notes 15(1974) 230–243.Google Scholar
  2. [2]
    A. Lindenmayer: Mathematical models for cellular interaction in development, J. Theor. Biology 18(1968) 280–315.Google Scholar
  3. [3]
    S. Maciane: A combinatorial condition for planar graphs, Fund. Math. 28(1937) 22–32.Google Scholar
  4. [4]
    W.T. Tutte: Convex representation of graphs, Proc. London Math. Soc. 10(1960) 304–320.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Kristian Nyrup
    • 1
  • Brian Mayoh
    • 1
  1. 1.Department of Computer ScienceAarhus UniversityAarhus CDenmark

Personalised recommendations