The failure of the strong pumping lemma for multiple context-free languages (Q2254497): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-014-9534-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2077206882
@@ Property / OpenAlex ID: W2077206882 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q125055634
@@ Property / Wikidata QID: Q125055634 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385528
@@ Property / cites work: Q4385528 / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchy theorems for two-way finite state transducers
+Normal rank
@@ Property / cites work @@
+One way finite visit automata
@@ Property / cites work: One way finite visit automata / rank @@
+Normal rank
@@ Property / cites work @@
+The Pumping Lemma for Well-Nested Multiple Context-Free Languages
+Normal rank
@@ Property / cites work @@
+The Copying Power of Well-Nested Multiple Context-Free Grammars
+Normal rank
@@ Property / cites work @@
+On multiple context-free grammars
@@ Property / cites work: On multiple context-free grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q3409073
@@ Property / cites work: Q3409073 / 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 @@
+A geometric hierarchy beyond context-free languages
+Normal rank