A pumping lemma for deterministic context-free languages (Q1120293): Difference between revisions

@@ Property / author @@
+Sheng Yu
@@ Property / author: Sheng Yu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(89)90108-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2009481224
@@ Property / OpenAlex ID: W2009481224 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124820415
@@ Property / Wikidata QID: Q124820415 / rank @@
+Normal rank
@@ Property / cites work @@
+Two iteration theorems for the LL(k) languages
@@ Property / cites work: Two iteration theorems for the LL(k) languages / rank @@
+Normal rank
@@ Property / cites work @@
+Normal forms of deterministic grammars
@@ Property / cites work: Normal forms of deterministic grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+A Formalization of Transition Diagram Systems
@@ Property / cites work: A Formalization of Transition Diagram Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank