---

＜電子ブック＞
Graph-Grammars and Their Application to Computer Science and Biology : International Workshop, Bad Honnef, October 30 - November 3, 1978 / edited by V. Claus, H. Ehrig, G. Rozenberg
(Lecture Notes in Computer Science. ISSN:16113349 ; 73)

版	1st ed. 1979.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1979
本文言語	英語
大きさ	X, 486 p : online resource
著者標目	Claus, V editor Ehrig, H editor Rozenberg, G editor SpringerLink (Online service)
件　名	LCSH:Computer science FREE:Theory of Computation FREE:Computer Science
一般注記	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 HTTP:URL=https://doi.org/10.1007/BFb0025713

 類似資料