The Turing degree of the inherent ambiguity problem for context-free languages (Q1220391): Difference between revisions

@@ 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/0304-3975(75)90013-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2019243334
@@ Property / OpenAlex ID: W2019243334 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292904
@@ Property / cites work: Q3292904 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5576254
@@ Property / cites work: Q5576254 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583856
@@ Property / cites work: Q5583856 / 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 @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank