GRAPH GRAMMAR (Sequential) 2)5)
← Back
D. GERNERT explains how graphs can be rewrited, thus generating a sequential graph grammar through embedding rules. He describes as follows some important properties of this type of representation graphs:
1. The new graph generated by a production rule can be "more complex"or "less complex" than the old one
2. The continuation of the rewriting process is not necessarily unique: there may be nondeterminism as well as determinism, or a combination of both, depending on the features of the individual graph grammar
3. There may be different sequences of derivation steps which lead to the same result, the "genesis" of a graph is not necessarily unique
4. A sequence of derivation steps can lead to the start graph again: "periodic graph grammars" are possible
5. In degenerate cases it may happen that none of the production rules are applicable so that the procedure stops
Categories
- 1) General information
- 2) Methodology or model
- 3) Epistemology, ontology and semantics
- 4) Human sciences
- 5) Discipline oriented
Publisher
Bertalanffy Center for the Study of Systems Science(2020).
To cite this page, please use the following information:
Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]
We thank the following partners for making the open access of this volume possible: