Ogden's lemma for nonterminal bounded languages (Q3768421): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W92423482
@@ Property / OpenAlex ID: W92423482 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124809351
@@ Property / Wikidata QID: Q124809351 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization of LR(k) parsers
@@ Property / cites work: Optimization of LR(k) parsers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4168086
@@ Property / cites work: Q4168086 / rank @@
+Normal rank
@@ Property / cites work @@
+Ogden's lemma for nonterminal bounded languages
@@ Property / cites work: Ogden's lemma for nonterminal bounded languages / rank @@
+Normal rank
@@ Property / cites work @@
+Linearity is polynomially decidable for realtime pushdown store automata
+Normal rank
@@ Property / cites work @@
+The Unsolvability of the Recognition of Linear Context-Free Languages
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+A helpful result for proving inherent ambiguity
@@ Property / cites work: A helpful result for proving inherent ambiguity / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3768421