Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645): Difference between revisions

@@ Property / cites work @@
+Non‐associative Lambek Categorial Grammar in Polynomial Time
+Normal rank
@@ Property / cites work @@
+The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
+Normal rank
@@ Property / cites work @@
+Q4263011
@@ Property / cites work: Q4263011 / rank @@
+Normal rank
@@ Property / cites work @@
+The Mathematics of Sentence Structure
@@ Property / cites work: The Mathematics of Sentence Structure / rank @@
+Normal rank
@@ Property / cites work @@
+Q3846669
@@ Property / cites work: Q3846669 / rank @@
+Normal rank
@@ Property / cites work @@
+Lambek calculus is NP-complete
@@ Property / cites work: Lambek calculus is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of derivability for the Lambek calculus with one division
+Normal rank