Hyperedge replacement: grammars and languages
From MaRDI portal
Publication:684560
zbMATH Open0787.68066MaRDI QIDQ684560FDOQ684560
Authors: Annegret Habel 
Publication date: 20 September 1993
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Cited In (only showing first 100 items - show all)
- A Local Greibach Normal Form for Hyperedge Replacement Grammars
- On cylindrical graph construction and its applications
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- Towards a systematic method for proving termination of graph transformation systems
- Algebraic approach to single-pushout graph transformation
- Categorical principles, techniques and results for high-level-replacement systems in computer science
- Title not available (Why is that?)
- Decision problems for edge grammars
- Second-order abstract categorial grammars as hyperedge replacement grammars
- The generating power of total deterministic tree transducers
- Algorithmic uses of the Feferman-Vaught theorem
- \(k\)-NLC graphs and polynomial algorithms
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)
- Model-checking hierarchical structures
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Basic notions of universal algebra for language theory and graph grammars
- Tree-width and the monadic quantifier hierarchy.
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Metatheorems for decision problems on hyperedge replacement graph languages
- A partial k-arboretum of graphs with bounded treewidth
- Title not available (Why is that?)
- The complexity of graph languages generated by hyperedge replacement
- Monadic second-order definable graph transductions: a survey
- Powerful and NP-complete: hypergraph Lambek grammars
- A Greibach normal form for context-free graph grammars
- Transformations of graph grammars
- Deterministic graph grammars
- Concurrent graph and term graph rewriting
- Recognising \(k\)-connected hypergraphs in cubic time
- A general framework for types in graph rewriting
- Cooperating distributed hyperedge replacement grammars
- Probabilistic hyperedge replacement grammars
- Uniform parsing for hyperedge replacement grammars
- Hypergraph languages of bounded degree
- Decidability of the finiteness of ranges of tree transductions
- Handle-rewriting hypergraph grammars
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Node rewriting in graphs and hypergraphs: A categorical framework
- The generative power of delegation networks
- Logical description of context-free graph languages
- Hierarchical graph transformation
- Monadic second-order evaluations on tree-decomposable graphs
- On the regular structure of prefix rewriting
- Characteristics of graph languages generated by edge replacement
- Context-free hypergraph grammars with node rewriting
- The translation power of top-down tree-to-graph transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constant delay traversal of grammar-compressed graphs with bounded rank
- Contextual hyperedge replacement
- Introduction to graph grammars with applications to semantic networks
- On hyperedge replacement and BNLC graph grammars
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- The monadic second-order logic of graphs. VIII: Orientations
- Adaptive star grammars and their languages
- Using attributed flow graph parsing to recognize clichés in programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two strikes against perfect phylogeny
- Generating self-affine fractals by collage grammars
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs
- Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
- Hierarchical design rewriting with Maude
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Parallel high-level replacement systems
- Graph transformation for incremental natural language analysis
- Criteria to disprove context freeness of collage languages.
- Preserving consistency in geometric modeling with graph transformations
- Spatial existential positive logics for hyperedge replacement grammars
- Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power
- On the interleaving semantics of transformation units -- a step into GRACE
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
- Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete
- Title not available (Why is that?)
- Selected Decision Problems for Square-Refinement Collage Grammars
- Graph grammars according to the type of input and manipulated data: a survey
- Concatenation of graphs
- Graph unification and matching
- Single pushout transformations of equationally defined graph structures with applications to actor systems
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- P systems with local graph productions
- Graph-Based Design and Analysis of Dynamic Software Architectures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exponential time analysis of confluent and boundary eNCE graph languages
- On the power of local graph expansion grammars with and without additional restrictions
- Graph parsing as graph transformation. Correctness of predictive top-down parsers
- Language theoretic properties of regular DAG languages
- The bounded degree problem for non-obstructing eNCE graph grammars
- Title not available (Why is that?)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- The complexity of connectivity problems on context-free graph languages
- On spectra of sentences of monadic second order logic with counting
This page was built for publication: Hyperedge replacement: grammars and languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684560)
