scientific article
From MaRDI portal
Publication:3785988
zbMath0643.68106MaRDI QIDQ3785988
Annegret Habel, Hans-Joerg Kreowski
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (36)
Monadic second-order definable graph transductions: a survey ⋮ Handle-rewriting hypergraph grammars ⋮ The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ The translation power of top-down tree-to-graph transducers ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Synthesized and inherited functions. A new computational model for syntax-directed semantics ⋮ The monadic second-order logic of graphs. I: Recognizable sets of finite graphs ⋮ Uniform parsing for hyperedge replacement grammars ⋮ Metatheorems for decision problems on hyperedge replacement graph languages ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ Logical description of context-free graph languages ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ On relating rewriting systems and graph grammars to event structures ⋮ The generative power of delegation networks ⋮ Graph-theoretic properties compatible with graph derivations ⋮ Undecidability of the bandwidth problem on linear graph languages ⋮ Graph transformation for incremental natural language analysis ⋮ Algorithms for graph problems on BNLC structured garphs ⋮ The string generating power of context-free hypergraph grammars ⋮ The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability ⋮ The monadic second-order logic of graphs. VII: Graphs as relational structures ⋮ Algebraic approach to single-pushout graph transformation ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ Recursively indefinite databases ⋮ Lyndon trees ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ A Greibach normal form for context-free graph grammars ⋮ Applications of a hyper-graph grammar system in adaptive finite-element computations ⋮ Infinite hypergraphs. I: Basic properties ⋮ 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 ⋮ Generating irregular partitionable data structures ⋮ Modular tree transducers ⋮ Hypergraph languages of bounded degree
This page was built for publication:
