scientific article
From MaRDI portal
Publication:3785987
zbMath0643.68105MaRDI QIDQ3785987
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05)
Related Items
Correctness of fixpoint transformations, The translation power of top-down tree-to-graph transducers, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, 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, Courcelle's theorem for triangulations, Metatheorems for decision problems on hyperedge replacement graph languages, Graph expressions and graph rewritings, Undecidability of the bandwidth problem on linear graph languages, Algorithms for graph problems on BNLC structured garphs, Algorithms for recognition of regular properties and decomposition of recursive graph families, Branch-width, parse trees, and monadic second-order logic for matroids., The HOMFLY-PT polynomial is fixed-parameter tractable, A comparison of compatible, finite, and inductive graph properties, Recursive queries and context-free graph grammars, Complexity of abstract argumentation under a claim-centric view
