Graph-Grammars and Their Application to Computer Science and Biology
International Workshop, Bad Honnef, October 30 - November 3, 1978
Published on 1. July 1979
Book
Paperback/Softback
X, 486 pages
978-3-540-09525-5 (ISBN)
Description
to the algebraic theory of graph grammars (a survey).- A tutorial and bibliographical survey on graph grammars.- Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls.- Rewriting systems as a tool for relational data base design.- Programmed graph grammars.- Shortest path problems and tree grammars: An algebraic framework.- Constructing specifications of abstract data types by replacements.- Decomposition of graph grammar productions and derivations.- Locally star gluing formulas for a class of parallel graph grammars.- Transformations of data base structures.- Explicit versus implicit parallel rewriting on graphs.- Two-level graph grammars.- A pumping lemma for context-free graph languages.- Two-dimensional, differential, intercalary plant tissue growth and parallel graph generating and graph recurrence systems.- Parallel generation of maps: Developmental systems for cell layers.- Processes in structures.- Map grammars: Cycles and the algebraic approach.- On multilevel - Graph grammars.- Graph grammars and operational semantics.- Complexity of pattern generation by map-L systems.- A graph grammar that describes the set of two-dimensional surface networks.- Definition of programming language semantics using grammars for hierarchical graphs.- Determinism in relational systems.- Analysis of programs by reduction of their structure.- Graphs of processors.- Definitional mechanisms for conceptual graphs.- A graph-like lambda calculus for which leftmost-outermost reduction is optimal.- Relationships between graph grammars and the design and analysis of concurrent software.- Cellular graph automata.- List of participants.
More details
Series
Edition
1979 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 486 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 27 mm
Weight
739 gr
ISBN-13
978-3-540-09525-5 (9783540095255)
DOI
10.1007/BFb0025713
Schweitzer Classification
Content
to the algebraic theory of graph grammars (a survey).- A tutorial and bibliographical survey on graph grammars.- Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls.- Rewriting systems as a tool for relational data base design.- Programmed graph grammars.- Shortest path problems and tree grammars: An algebraic framework.- Constructing specifications of abstract data types by replacements.- Decomposition of graph grammar productions and derivations.- Locally star gluing formulas for a class of parallel graph grammars.- Transformations of data base structures.- Explicit versus implicit parallel rewriting on graphs.- Two-level graph grammars.- A pumping lemma for context-free graph languages.- Two-dimensional, differential, intercalary plant tissue growth and parallel graph generating and graph recurrence systems.- Parallel generation of maps: Developmental systems for cell layers.- Processes in structures.- Map grammars: Cycles and the algebraic approach.- On multilevel - Graph grammars.- Graph grammars and operational semantics.- Complexity of pattern generation by map-L systems.- A graph grammar that describes the set of two-dimensional surface networks.- Definition of programming language semantics using grammars for hierarchical graphs.- Determinism in relational systems.- Analysis of programs by reduction of their structure.- Graphs of processors.- Definitional mechanisms for conceptual graphs.- A graph-like lambda calculus for which leftmost-outermost reduction is optimal.- Relationships between graph grammars and the design and analysis of concurrent software.- Cellular graph automata.- List of participants.