scientific article
From MaRDI portal
Publication:3974863
zbMath0756.68070MaRDI QIDQ3974863
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
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, Context-free graph languages of bounded degree are generated by apex graph grammars, The equivalence of boundary and confluent graph grammars on graph languages of bounded degree, Logical description of context-free graph languages, Maximum flows in parametric graph templates, Order independent NCE grammars recognized in polynomial time, Graph automata for linear graph languages, GETGRATS, Context-free hypergraph grammars with node rewriting, Finite graph automata for linear and boundary graph languages, A Greibach normal form for context-free graph grammars, Unnamed Item, Nondeterministic operations on finite relational structures, The generating power of total deterministic tree transducers, Generating irregular partitionable data structures, A comparison of tree transductions defined by monadic second order logic and by attribute grammars, The complexity of the \(K_{n,n}\)-problem for node replacement graph languages, Hypergraph languages of bounded degree
