Lower bounds for context-free grammars (Q1944159): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2011.06.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2055190789
@@ Property / OpenAlex ID: W2055190789 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5437181
@@ Property / cites work: Q5437181 / rank @@
+Normal rank
@@ Property / cites work @@
+The Smallest Grammar Problem
@@ Property / cites work: The Smallest Grammar Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Generating all permutations by context-free grammars in Chomsky normal form
+Normal rank
@@ Property / cites work @@
+Generating all permutations by context-free grammars in Greibach normal form
+Normal rank
@@ Property / cites work @@
+Q3505125
@@ Property / cites work: Q3505125 / rank @@
+Normal rank
@@ Property / cites work @@
+GENERATING ALL CIRCULAR SHIFTS BY CONTEXT-FREE GRAMMARS IN GREIBACH NORMAL FORM
+Normal rank
@@ Property / cites work @@
+Complexity of normal form grammars
@@ Property / cites work: Complexity of normal form grammars / rank @@
+Normal rank