On the computational power of context-free PC grammar systems (Q1566712): Difference between revisions

@@ Property / author @@
-Niculae Mandache
@@ Property / author: Niculae Mandache / rank @@
-Normal rank
@@ Property / author @@
+Niculae Mandache
@@ Property / author: Niculae Mandache / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886800
@@ Property / cites work: Q4886800 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4319710
@@ Property / cites work: Q4319710 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3893911
@@ Property / cites work: Q3893911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3686043
@@ Property / cites work: Q3686043 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonreturning PC grammar systems can be simulated by returning systems
+Normal rank
@@ Property / cites work @@
+Register machine proof of the theorem on exponential diophantine representation of enumerable sets
+Normal rank
@@ Property / cites work @@
+Q5613949
@@ Property / cites work: Q5613949 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3982094
@@ Property / cites work: Q3982094 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(98)00159-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2001356001
@@ Property / OpenAlex ID: W2001356001 / rank @@
+Normal rank