
×
Graph-Grammars and Their Application to Computer Science
2nd International Workshop. Haus Ohrbeck, Germany, October 4 - 8, 1982
herausgegeben von H. Ehrig, M. Nagl und G. RozenbergInhaltsverzeichnis
- Grammatical inference of graph grammars for syntactic pattern recognition.
- Graph grammars as a generative tool in image understanding.
- Graph grammars for distributed systems.
- Algorithms for the generation and drawing of maps representing cell clones.
- Aspects of concurrency in graph grammars.
- Church-Rosser properties for graph replacement systems with unique splitting.
- Specification of data bases through rewriting rules.
- Petri nets and their relation to graph grammars.
- Attributed graph grammars for graphics.
- On context-free graph languages generated by edge replacement.
- Modelling compiler generation by graph grammars.
- Hypergraph systems generating graph languages.
- Graph grammars with node-label controlled rewriting and embedding.
- Parsing of graphs in linear time.
- Generation of 3-dimensional plant bodies by double wall map and stereomap systems.
- Chain code picture languages.
- A graph-relational approach to geographic databases.
- Graph transductions in the field of automatic translation of natural languages.
- Software specification by graph grammars.
- Geometry versus topology in Map grammars.
- Transformation of structures by convex homomorphisms.
- Formal specification of software using H-graph semantics.
- Cellular computers for parallel region-level image processing.
- Tree-graph grammars for pattern recognition.
- The isomorphism problem is polynomially solvable for certain graph languages.
- Space-filling curves and infinite graphs.
- Two-level expression representation for faster evaluation.
- Characterization of graph classes by forbidden structures and reductions.
- On graph rewriting systems (Graph-Grammars).