• Publications
  • Influence
Linear Graph Grammars: Power and Complexity
TLDR
A graph grammar is linear if it generates graphs with at most one nonterminal node. Expand
  • 48
  • 4
  • PDF
Boundary Graph Grammars with Dynamic Edge Relabeling
TLDR
We show that eNCE graph grammars generate node-labeled graphs with edge labels as well. Expand
  • 46
  • 3
Net-Based Description Of Parallel Object-Based Systems, or POTs and POPs
TLDR
Two formalisms, called POT and POP, are introduced for modelling parallel object-based systems. Expand
  • 40
  • 2
Complexity of boundary graph languages
TLDR
Les languages de graphes connexes et de degre borne qui sont engendres par des grammaires de type «boundary eNCE» sont dans LOG(CF, c'est-a-dire qu'il est possible de reduire ces langages a un langage algebrique en espace logarithmique. Expand
  • 21
  • 2
  • PDF
Nonterminal Separation in Graph Grammars
TLDR
Nonterminal separation in eNCE graph grammars is introduced: such a graph grammar is k -separated (with k ⩾1) if the distance between any two nonterminal nodes in any of its sentential forms is at least k. Expand
  • 16
  • 1
Context-free graph languages of bounded degree are generated by apex graph grammars
TLDR
The apex graph grammars generate precisely the context-free graph languages of bounded degree, independently of whether one considers hyperedge replacement systems or (boundary or confluent) NLC or edNCE graph Grammars. Expand
  • 7
  • 1
Apex Graph Grammars
TLDR
Apex graph grammars are NLC-like graph Grammars with the restriction that embedding edges are established between terminal nodes only. Expand
  • 24
Nonterminal Bounded NLC Graph Grammars
Il est montre que ces grammaires ne peuvent pas etre simulees par une grammaire graphe lineaire
  • 7
FORMALIZING THE BEHAVIOUR OF PARALLEL OBJECT-BASED SYSTEMS BY PETRI NETS
TLDR
Parallel object-based systems are modelled by POTs, where a POT is a Petri net with an additional structure imposed on its places (POT abbreviates Parallel Object-based Transition system). Expand
  • 7
Apex graph grammars and attribute grammars
TLDR
Apex graph grammars are a particular type of directed node-label controlled (DNLC) graph Grammars: the embedding edges are established between terminal nodes only. Expand
  • 6