A Greibach normal form for context-free graph grammars (Q5204313): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-55719-9_70
+Normal rank
@@ Property / OpenAlex ID @@
+W2152195025
@@ Property / OpenAlex ID: W2152195025 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph expressions and graph rewritings
@@ Property / cites work: Graph expressions and graph rewritings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding uniform emulations on paths and ring networks
+Normal rank
@@ Property / cites work @@
+Q3787507
@@ Property / cites work: Q3787507 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
+Normal rank
@@ Property / cites work @@
+An axiomatic definition of context-free rewriting and its application to NLC graph grammars
+Normal rank
@@ Property / cites work @@
+Q3830540
@@ Property / cites work: Q3830540 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4852905
@@ Property / cites work: Q4852905 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3974863
@@ Property / cites work: Q3974863 / rank @@
+Normal rank
@@ Property / cites work @@
+The string generating power of context-free hypergraph grammars
+Normal rank
@@ Property / cites work @@
+Context-free hypergraph grammars have the same term-generating power as attribute grammars
+Normal rank
@@ Property / cites work @@
+Hypergraph languages of bounded degree
@@ Property / cites work: Hypergraph languages of bounded degree / rank @@
+Normal rank
@@ Property / cites work @@
+Context-free graph languages of bounded degree are generated by apex graph grammars
+Normal rank
@@ Property / cites work @@
+Linear graph grammars: Power and complexity
@@ Property / cites work: Linear graph grammars: Power and complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Apex graph grammars and attribute grammars
@@ Property / cites work: Apex graph grammars and attribute grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Nonterminal separation in graph grammars
@@ Property / cites work: Nonterminal separation in graph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary graph grammars with dynamic edge relabeling
+Normal rank
@@ Property / cites work @@
+A comparison of boundary graph grammars and context-free hypergraph grammars
+Normal rank
@@ Property / cites work @@
+Q4037292
@@ Property / cites work: Q4037292 / rank @@
+Normal rank
@@ Property / cites work @@
+Derivation-bounded languages
@@ Property / cites work: Derivation-bounded languages / rank @@
+Normal rank
@@ Property / cites work @@
+A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
+Normal rank
@@ Property / cites work @@
+Hyperedge replacement: grammars and languages
@@ Property / cites work: Hyperedge replacement: grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3774975
@@ Property / cites work: Q3774975 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785988
@@ Property / cites work: Q3785988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789084
@@ Property / cites work: Q3789084 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795250
@@ Property / cites work: Q3795250 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795251
@@ Property / cites work: Q3795251 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Equations and Normal Forms for Context-Free Grammars
+Normal rank
@@ Property / cites work @@
+Q4694744
@@ Property / cites work: Q4694744 / rank @@
+Normal rank