Publication:4194478
From MaRDI portal
zbMath0407.68072MaRDI QIDQ4194478
Publication date: 1979
Research Survey; Compiler; Elementary Exposition; Developmental System; Data Base System; Recursively Defined Functions; Algebraic Theory of Graph Grammars; Categorical Methods; Church- Rosser Properties; Evolution in Biology; Gluing Constructions; Parallel Graph Grammars; Record Handling; Sequential Graph Grammar
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
68-02: Research exposition (monographs, survey articles) pertaining to computer science
18B20: Categories of machines, automata
Related Items
Adhesive and quasiadhesive categories, Node rewriting in graphs and hypergraphs: A categorical framework, Locating the contractum in the double pushout approach, Confluence for graph transformations, On categorical graph grammars integrating structural transformations and operations on labels, Algebraic approach to single-pushout graph transformation, Parallel and distributed derivations in the single-pushout approach, On structured graph grammars. I, Pushout-complements and basic concepts of grammars in toposes, Note on node-rewriting graph grammars, Structural and behavioural compatibility of graphical service specifications, Construction and properties of adhesive and weak adhesive high-level replacement categories, A framework for the verification of infinite-state graph transformation systems, Graph theoretic closure properties of the family of boundary NLC graph languages, Net processes correspond to derivation processes in graph grammars, Combinatorial properties of boundary NLC graph languages, String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing, Characteristics of graph languages generated by edge replacement, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Comparison of two graph-rewrite systems, Confluence of indirection reductions in graph rewrite systems, A characterization of context-free string languages by directed node- label controlled graph grammars, Decision problems for node label controlled graph grammars, On the generative power of sequential and parallel programmed graph grammars, Graph grammars with neighbourhood-controlled embedding, Graph grammars and operational semantics, Processes of transforming structures, Foundations of rule-based design of modular systems, Conditional rewriting logic as a unified model of concurrency, Term graph rewriting and garbage collection using opfibrations, CGOOD, a categorical graph-oriented object data model, Parallel high-level replacement systems, Algebraic transformation of unary partial algebras. I: Double-pushout approach, Formal software specification with refinements and modules of typed graph transformation systems, Amalgamation of graph transformations: a synchronization mechanism, Categorical approach to the construction of fuzzy graph grammars, Confluence theory for graphs, The uniqueness condition for the double pushout transformation of algebras, A general framework for types in graph rewriting, Implementing term rewriting by jungle evaluation, Transformations in Reconfigurable Place/Transition Systems, Unnamed Item, Unnamed Item
