In this paper we develop a theory of context-free graph grammars. Formal properties of such grammars are proven, with particular attention to graph language recognizability
Abstract: Deterministic graph grammars generate a family of infinite graphs which characterize conte...
Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programmi...
In the compiler literature, parsing algorithms for context-free grammars are presented using string ...
AbstractThis paper describes regular and context-free grammars as certain morphisms of graphs, and t...
A precise topological characterization of classes of graphs generated by certain context free graph ...
International audienceDeterministic graph grammars generate a family of infinite graphs which charac...
Deterministic graph grammars generate a family of infinite graphs which characterize context-free (w...
Topological characterizations of sets of graphs which can be generated by context- free or linear gr...
AbstractSeveral models of ‘graph grammars’ have been studied with the objective of generating graphs...
Graph grammars are graph replacement systems and can be therefore regarded as a generalization of we...
AbstractThe generalisation of confluent node rewriting, a context-free graph grammar approach, to hy...
AbstractThe complexity of languages generated by so-called context-free string grammars with disconn...
AbstractContext-free hypergraph grammars generate the same string languages as deterministic tree-wa...
AbstractIn this paper we define graph grammars, called the node-replacement graph grammars with path...
AbstractA graph languageLis in the class C-edNCE of context-free edNCE graph languages if and only i...
Abstract: Deterministic graph grammars generate a family of infinite graphs which characterize conte...
Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programmi...
In the compiler literature, parsing algorithms for context-free grammars are presented using string ...
AbstractThis paper describes regular and context-free grammars as certain morphisms of graphs, and t...
A precise topological characterization of classes of graphs generated by certain context free graph ...
International audienceDeterministic graph grammars generate a family of infinite graphs which charac...
Deterministic graph grammars generate a family of infinite graphs which characterize context-free (w...
Topological characterizations of sets of graphs which can be generated by context- free or linear gr...
AbstractSeveral models of ‘graph grammars’ have been studied with the objective of generating graphs...
Graph grammars are graph replacement systems and can be therefore regarded as a generalization of we...
AbstractThe generalisation of confluent node rewriting, a context-free graph grammar approach, to hy...
AbstractThe complexity of languages generated by so-called context-free string grammars with disconn...
AbstractContext-free hypergraph grammars generate the same string languages as deterministic tree-wa...
AbstractIn this paper we define graph grammars, called the node-replacement graph grammars with path...
AbstractA graph languageLis in the class C-edNCE of context-free edNCE graph languages if and only i...
Abstract: Deterministic graph grammars generate a family of infinite graphs which characterize conte...
Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programmi...
In the compiler literature, parsing algorithms for context-free grammars are presented using string ...
DOI
Add to ORKG