Publication:3785988
From MaRDI portal
zbMath0643.68106MaRDI QIDQ3785988
Hans-Joerg Kreowski, Annegret Habel
Publication date: 1987
Related Items
Algebraic approach to single-pushout graph transformation, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, Recursively indefinite databases, Modular tree transducers, Undecidability of the bandwidth problem on linear graph languages, Metatheorems for decision problems on hyperedge replacement graph languages, Power properties of NLC graph grammars with a polynomial membership problem, 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, Context-free hypergraph grammars have the same term-generating power as attribute grammars, Lyndon trees, The equivalence of bottom-up and top-down tree-to-graph transducers, A partial k-arboretum of graphs with bounded treewidth, Hypergraph languages of bounded degree, Monadic second-order definable graph transductions: a survey, 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, Logical description of context-free graph languages, Generating irregular partitionable data structures, Infinite hypergraphs. I: Basic properties, Handle-rewriting hypergraph grammars, The monadic second-order logic of graphs. I: Recognizable sets of finite graphs, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
