Publication:3785987
From MaRDI portal
zbMath0643.68105MaRDI QIDQ3785987
Publication date: 1987
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
68Q65: Abstract data types; algebraic specification
08B05: Equational logic, Mal'tsev conditions
Related Items
Recursive queries and context-free graph grammars, Undecidability of the bandwidth problem on linear graph languages, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Metatheorems for decision problems on hyperedge replacement graph languages, Algorithms for graph problems on BNLC structured garphs, Algorithms for recognition of regular properties and decomposition of recursive graph families, Correctness of fixpoint transformations, The translation power of top-down tree-to-graph transducers, A comparison of compatible, finite, and inductive graph properties, Branch-width, parse trees, and monadic second-order logic for matroids., The monadic second-order logic of graphs. I: Recognizable sets of finite graphs, The monadic second-order logic of graphs, II: Infinite graphs of bounded width, Graph expressions and graph rewritings