In [1], for directed graphs, it was shown that the system of simple graph grammars is complete. In this paper, a system of grammars for plane graphs, called plane graph grammars, is introduced, and it is shown that this system is complete, ..
A precise topological characterization of classes of graphs generated by certain context free graph ...
International audienceWhile some heuristics exist for the learning of graph grammars, few has been d...
AbstractIn this paper we define graph grammars, called the node-replacement graph grammars with path...
International audienceThough graph grammars have been widely investigated for 40 years, few learning...
International audienceThough graph grammars have been widely investigated for 40 years, few learning...
AbstractA graph grammar is linear if it generates graphs with at most one nonterminal node. Linear g...
International audienceWhile some heuristics exist for the learning of graph grammars, few has been d...
This paper is concerned with the class of “web grammars,≓ introduced by Pfaltz and Rosenfeld, whose ...
AbstractContext-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree h...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
AbstractWe introduce a hypergraph-generating system, called HRNCE grammars, which is structurally si...
AbstractWe introduce a graph-grammar model based on edge-replacement, where both the rewriting and t...
We investigate sequential derivation languages associated with graph grammars, as a loose generalisa...
AbstractA central feature that distinguishes graph grammars (we consider grammars generating sets of...
AbstractA mechanism for constructing families of “similar” graphs is introduced. This mechanism is e...
A precise topological characterization of classes of graphs generated by certain context free graph ...
International audienceWhile some heuristics exist for the learning of graph grammars, few has been d...
AbstractIn this paper we define graph grammars, called the node-replacement graph grammars with path...
International audienceThough graph grammars have been widely investigated for 40 years, few learning...
International audienceThough graph grammars have been widely investigated for 40 years, few learning...
AbstractA graph grammar is linear if it generates graphs with at most one nonterminal node. Linear g...
International audienceWhile some heuristics exist for the learning of graph grammars, few has been d...
This paper is concerned with the class of “web grammars,≓ introduced by Pfaltz and Rosenfeld, whose ...
AbstractContext-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree h...
AbstractThis paper sets into relation three different classes of trees: (i) mod r-valent planted pla...
AbstractWe introduce a hypergraph-generating system, called HRNCE grammars, which is structurally si...
AbstractWe introduce a graph-grammar model based on edge-replacement, where both the rewriting and t...
We investigate sequential derivation languages associated with graph grammars, as a loose generalisa...
AbstractA central feature that distinguishes graph grammars (we consider grammars generating sets of...
AbstractA mechanism for constructing families of “similar” graphs is introduced. This mechanism is e...
A precise topological characterization of classes of graphs generated by certain context free graph ...
International audienceWhile some heuristics exist for the learning of graph grammars, few has been d...
AbstractIn this paper we define graph grammars, called the node-replacement graph grammars with path...
DOI
Add to ORKG