DOIAbstract
AbstractThe lecture is based on a chapter of a forthcoming handbook of graph grammars, edited by G. Rozenberg. This chapter is entitled: “The expression of graph properties and graph transformations in monadic second-order logic”
AbstractThe lecture is based on a chapter of a forthcoming handbook of graph grammars, edited by G. Rozenberg. This chapter is entitled: “The expression of graph properties and graph transformations in monadic second-order logic”
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives ris...
AbstractThe lecture is based on a chapter of a forthcoming handbook of graph grammars, edited by G. ...
AbstractThis lecture surveys about 15 years of research about context-free graph grammars, graph ope...
AbstractThis lecture surveys about 15 years of research about context-free graph grammars, graph ope...
AbstractThe same properties of graphs of degree at most k, where k is a fixed integer, can be expres...
AbstractGraphs are finite and handled as relational structures. We give some answers to the followin...
AbstractRelational structures form a unique framework in which various types of graphs and hypergrap...
AbstractThe same properties of graphs of degree at most k, where k is a fixed integer, can be expres...
AbstractRelational structures form a unique framework in which various types of graphs and hypergrap...
AbstractThe class of monadic second-order definable graph languages is the smallest class containing...
AbstractFormulas of monadic second-order logic can be used to specify graph transductions, i.e., mul...
AbstractContext-free graph-grammars are considered such that, in every generated graph G, a derivati...
Abstract. The core challenge in a Hoare- or Dijkstra-style proof sys-tem for graph programs is in de...
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives ris...
AbstractThe lecture is based on a chapter of a forthcoming handbook of graph grammars, edited by G. ...
AbstractThis lecture surveys about 15 years of research about context-free graph grammars, graph ope...
AbstractThis lecture surveys about 15 years of research about context-free graph grammars, graph ope...
AbstractThe same properties of graphs of degree at most k, where k is a fixed integer, can be expres...
AbstractGraphs are finite and handled as relational structures. We give some answers to the followin...
AbstractRelational structures form a unique framework in which various types of graphs and hypergrap...
AbstractThe same properties of graphs of degree at most k, where k is a fixed integer, can be expres...
AbstractRelational structures form a unique framework in which various types of graphs and hypergrap...
AbstractThe class of monadic second-order definable graph languages is the smallest class containing...
AbstractFormulas of monadic second-order logic can be used to specify graph transductions, i.e., mul...
AbstractContext-free graph-grammars are considered such that, in every generated graph G, a derivati...
Abstract. The core challenge in a Hoare- or Dijkstra-style proof sys-tem for graph programs is in de...
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri...
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives ris...
Add to ORKG