The Pumping Lemma for Well-Nested Multiple Context-Free Languages (Q3637235): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02737-6_25
+Normal rank
@@ Property / OpenAlex ID @@
+W1499005716
@@ Property / OpenAlex ID: W1499005716 / rank @@
+Normal rank
@@ Property / cites work @@
+The string generating power of context-free hypergraph grammars
+Normal rank
@@ Property / cites work @@
+On parsing coupled-context-free languages
@@ Property / cites work: On parsing coupled-context-free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Closure properties of linear context-free tree languages with an application to optimality theory
+Normal rank
@@ Property / cites work @@
+Q3409073
@@ Property / cites work: Q3409073 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4370242
@@ Property / cites work: Q4370242 / rank @@
+Normal rank
@@ Property / cites work @@
+Pumping lemmas for the control language hierarchy
@@ Property / cites work: Pumping lemmas for the control language hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Independent parallelism in finite copying parallel rewriting systems
+Normal rank
@@ Property / cites work @@
+On multiple context-free grammars
@@ Property / cites work: On multiple context-free grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of Formal Systems. (AM-47)
@@ Property / cites work: Theory of Formal Systems. (AM-47) / rank @@
+Normal rank