On the structure of linear apex NLC graph grammars (Q441855): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.02.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2032682009
@@ Property / OpenAlex ID: W2032682009 / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatic definition of context-free rewriting and its application to NLC graph grammars
+Normal rank
@@ Property / cites work @@
+Monadic second-order definable graph transductions: a survey
+Normal rank
@@ Property / cites work @@
+Q3668872
@@ Property / cites work: Q3668872 / rank @@
+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 @@
+Complexity of boundary graph languages
@@ Property / cites work: Complexity of boundary graph languages / 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 @@
+Logical description of context-free graph languages
+Normal rank
@@ Property / cites work @@
+Power properties of NLC graph grammars with a polynomial membership problem
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
+Normal rank
@@ Property / cites work @@
+On the structure of node-label-controlled graph languages
+Normal rank
@@ Property / cites work @@
+Graph grammars with neighbourhood-controlled embedding
+Normal rank
@@ Property / cites work @@
+Neighborhood-uniform NLC grammars
@@ Property / cites work: Neighborhood-uniform NLC grammars / rank @@
+Normal rank
@@ Property / cites work @@
+On sequential and parallel node-rewriting graph grammars
+Normal rank
@@ Property / cites work @@
+A hierarchy of eNCE families of graph languages
@@ Property / cites work: A hierarchy of eNCE families of graph languages / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient recognition algorithms for boundary and linear eNCE graph languages
+Normal rank
@@ Property / cites work @@
+Separation results for separated apex NLC and NCE graph languages
+Normal rank
@@ Property / cites work @@
+Separating \(k\)-separated eNCE graph languages
@@ Property / cites work: Separating \(k\)-separated eNCE graph languages / rank @@
+Normal rank
@@ Property / cites work @@
+Node replacement graph languages squeezed with chains, trees, and forests
+Normal rank
@@ Property / cites work @@
+String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
+Normal rank
@@ Property / cites work @@
+Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
+Normal rank