A pushdown automaton or a context-free grammar - which is more economical? (Q1165026): Difference between revisions

@@ Property / cites work @@
+Optimization of LR(k) parsers
@@ Property / cites work: Optimization of LR(k) parsers / rank @@
+Normal rank
@@ Property / cites work @@
+Economy of description by parsers, DPDA's, and PDA's
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+Size complexity in context-free grammars forms
@@ Property / cites work: Size complexity in context-free grammars forms / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-Turn Pushdown Automata
@@ Property / cites work: Finite-Turn Pushdown Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4105792
@@ Property / cites work: Q4105792 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / 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
@@ Property / cites work @@
+Q4070333
@@ Property / cites work: Q4070333 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4080744
@@ Property / cites work: Q4080744 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinctness of Descriptions of Unambiguous Context-Free Languages
+Normal rank
@@ Property / cites work @@
+A note on the succinctness of descriptions of deterministic languages
+Normal rank