Hyperedge replacement: grammars and languages
From MaRDI portal
Publication:684560
zbMath0787.68066MaRDI QIDQ684560
Publication date: 20 September 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)
Related Items
Monadic second-order definable graph transductions: a survey, The complexity of connectivity problems on context-free graph languages, Handle-rewriting hypergraph grammars, \(k\)-NLC graphs and polynomial algorithms, The translation power of top-down tree-to-graph transducers, Context-free graph languages of bounded degree are generated by apex graph grammars, Criteria to disprove context-freeness of collage languages, Probabilistic hyperedge replacement grammars, Preserving consistency in geometric modeling with graph transformations, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, On spectra of sentences of monadic second order logic with counting, The bounded degree problem for eNCE graph grammars, Uniform parsing for hyperedge replacement grammars, Algorithmic uses of the Feferman-Vaught theorem, The obstructions of a minor-closed set of graphs defined by a context-free grammar, Logical description of context-free graph languages, Single pushout transformations of equationally defined graph structures with applications to actor systems, Decision problems for edge grammars, Parallel high-level replacement systems, Graph Parsing as Graph Transformation, Specifying graph languages with type graphs, Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement, The generative power of delegation networks, Graph-Based Design and Analysis of Dynamic Software Architectures, Criteria to disprove context freeness of collage languages., Tree-width and the monadic quantifier hierarchy., Model-checking hierarchical structures, Concurrent graph and term graph rewriting, Exponential time analysis of confluent and boundary eNCE graph languages, Fixpoint logics over hierarchical structures, Graph transformation for incremental natural language analysis, Introduction to graph grammars with applications to semantic networks, Unnamed Item, Unnamed Item, Unnamed Item, Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete, Contextual hyperedge replacement, Basic notions of universal algebra for language theory and graph grammars, Generating self-affine fractals by collage grammars, Towards a Systematic Method for Proving Termination of Graph Transformation Systems, A category-theoretical approach to vertex replacement: The generation of infinite graphs, Graph unification and matching, On the interleaving semantics of transformation units — A step into GRACE, Using attributed flow graph parsing to recognize clichés in programs, The bounded degree problem for non-obstructing eNCE graph grammars, Concatenation of graphs, Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence, Transformations of graph grammars, The monadic second-order logic of graphs. VII: Graphs as relational structures, Graph grammars according to the type of input and manipulated data: a survey, On the regular structure of prefix rewriting, Algebraic approach to single-pushout graph transformation, Recognising \(k\)-connected hypergraphs in cubic time, Monadic second-order evaluations on tree-decomposable graphs, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, Categorical principles, techniques and results for high-level-replacement systems in computer science, P systems with local graph productions, NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\), Context-free hypergraph grammars with node rewriting, Second-order abstract categorial grammars as hyperedge replacement grammars, Hierarchical Design Rewriting with Maude, Language theoretic properties of regular DAG languages, Adaptive star grammars and their languages, Unnamed Item, The complexity of graph languages generated by hyperedge replacement, Bottom-up unranked tree-to-graph transducers for translation into semantic graphs, Node rewriting in graphs and hypergraphs: A categorical framework, A Greibach normal form for context-free graph grammars, Two strikes against perfect phylogeny, Unnamed Item, A comparison of compatible, finite, and inductive graph properties, Decidability of the finiteness of ranges of tree transductions, The equivalence of bottom-up and top-down tree-to-graph transducers, A partial k-arboretum of graphs with bounded treewidth, Selected Decision Problems for Square-Refinement Collage Grammars, The generating power of total deterministic tree transducers, Constant delay traversal of grammar-compressed graphs with bounded rank, The monadic second-order logic of graphs. VIII: Orientations, Macro tree transducers, attribute grammars, and MSO definable tree translations., The complexity of the \(K_{n,n}\)-problem for node replacement graph languages, On hyperedge replacement and BNLC graph grammars, A general framework for types in graph rewriting, Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs, Hypergraph languages of bounded degree, On cylindrical graph construction and its applications, Hierarchical graph transformation, Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
