Publication:3974863
From MaRDI portal
zbMath0756.68070MaRDI QIDQ3974863
Publication date: 26 June 1992
68Q42: Grammars and rewriting systems
Related Items
Unnamed Item, Order independent NCE grammars recognized in polynomial time, Nondeterministic operations on finite relational structures, The generating power of total deterministic tree transducers, 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, Context-free graph languages of bounded degree are generated by apex graph grammars, Logical description of context-free graph languages, Generating irregular partitionable data structures, A comparison of tree transductions defined by monadic second order logic and by attribute grammars, Finite graph automata for linear and boundary graph languages, The complexity of the \(K_{n,n}\)-problem for node replacement graph languages, Handle-rewriting hypergraph grammars