On the computational completeness of context-free parallel communicating grammar systems (Q1287096): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4290611
@@ Property / cites work: Q4290611 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonreturning PC grammar systems can be simulated by returning systems
+Normal rank
@@ Property / cites work @@
+Turing machines with restricted memory access
@@ Property / cites work: Turing machines with restricted memory access / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of context-free PC grammar systems
+Normal rank
@@ Property / cites work @@
+Q4226189
@@ Property / cites work: Q4226189 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3982094
@@ Property / cites work: Q3982094 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(98)00193-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1995375035
@@ Property / OpenAlex ID: W1995375035 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1287096