The complexity of regular DNLC graph languages (Q909473): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0022-0000(90)90004-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2030288301
@@ Property / OpenAlex ID: W2030288301 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57402283
@@ Property / Wikidata QID: Q57402283 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of regular DNLC graph languages
@@ Property / cites work: The complexity of regular DNLC graph languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785993
@@ Property / cites work: Q3785993 / rank @@
+Normal rank
@@ Property / cites work @@
+On the membership problem for regular DNLC grammars
+Normal rank
@@ Property / cites work @@
+Traces, dependency graphs and DNLC grammars
@@ Property / cites work: Traces, dependency graphs and DNLC grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of traces
@@ Property / cites work: Theory of traces / rank @@
+Normal rank
@@ Property / cites work @@
+Q3787507
@@ Property / cites work: Q3787507 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+A characterization of context-free string languages by directed node- label controlled graph grammars
+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 @@
+Q3795250
@@ Property / cites work: Q3795250 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219122
@@ Property / cites work: Q3219122 / rank @@
+Normal rank
@@ Property / cites work @@
+Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank
@@ Property / cites work @@
+On tape-bounded complexity classes and multihead finite automata
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank