scientific article
From MaRDI portal
Publication:3785986
zbMATH Open0643.68104MaRDI QIDQ3785986FDOQ3785986
Publication date: 1987
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Classical first-order logic (03B10) Equational logic, Mal'tsev conditions (08B05) Abstract data types; algebraic specification (68Q65)
Cited In (14)
- The refinement calculus of reactive systems
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- The contractum in algebraic graph rewriting
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Title not available (Why is that?)
- Graph expressions and graph rewritings
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The monadic second-order logic of graphs : Definable sets of finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relational graph rewritings
- Recursive queries and context-free graph grammars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785986)