, ,

Graph-Grammars and Their Application to Computer Science and Biology

International Workshop, Bad Honnef, October 30 - November 3, 1978

Specificaties
Paperback, 486 blz. | Engels
Springer Berlin Heidelberg | 1979e druk, 1979
ISBN13: 9783540095255
Rubricering
Springer Berlin Heidelberg 1979e druk, 1979 9783540095255
Onderdeel van serie Lecture Notes in Computer Science
€ 60,99
Levertijd ongeveer 9 werkdagen
Gratis verzonden

Specificaties

ISBN13:9783540095255
Taal:Engels
Bindwijze:paperback
Aantal pagina's:486
Uitgever:Springer Berlin Heidelberg
Druk:1979

Inhoudsopgave

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.
€ 60,99
Levertijd ongeveer 9 werkdagen
Gratis verzonden

Rubrieken

    Personen

      Trefwoorden

        Graph-Grammars and Their Application to Computer Science and Biology