On simple generators of recursively enumerable languages (Q743126): 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/j.jcss.2014.05.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1999654795
@@ Property / OpenAlex ID: W1999654795 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4366731
@@ Property / cites work: Q4366731 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4089754
@@ Property / cites work: Q4089754 / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection-closed full AFL and the recursively enumerable languages
+Normal rank
@@ Property / cites work @@
+The Hardest Context-Free Language
@@ Property / cites work: The Hardest Context-Free Language / rank @@
+Normal rank
@@ Property / cites work @@
+What makes some language theory problems undecidable
+Normal rank
@@ Property / cites work @@
+Q3969887
@@ Property / cites work: Q3969887 / rank @@
+Normal rank
@@ Property / cites work @@
+Developments in Language Theory
@@ Property / cites work: Developments in Language Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4826642
@@ Property / cites work: Q4826642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5804241
@@ Property / cites work: Q5804241 / rank @@
+Normal rank
@@ Property / cites work @@
+On some bounded semiAFLs and AFLs
@@ Property / cites work: On some bounded semiAFLs and AFLs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3312297
@@ Property / cites work: Q3312297 / rank @@
+Normal rank
@@ Property / cites work @@
+Modular elliptic curves and Fermat's Last Theorem
@@ Property / cites work: Modular elliptic curves and Fermat's Last Theorem / rank @@
+Normal rank