Back to University of Twente portal
Complete Symmetry in D2L Systems and Cellular Automata
Asveld, Peter R.J. (1986) Complete Symmetry in D2L Systems and Cellular Automata. International Journal of Computer Mathematics, 19 (3-4). pp. 211-223. ISSN 0020-7160
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 36Kb |
| Abstract: | We introduce completely symmetric D2L systems and cellular automata by means of an additional restriction on the corresponding symmetric devices. Then we show that completely symmetric D2L systems and cellular automata are still able to simulate Turing machine computations. As corollaries we obtain new characterizations of the recursively enumerable languages and of some space-bounded complexity classes. |
| Item Type: | Article |
| Copyright: | © 1986 Taylor & Francis |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/66012 |
| Official URL: | http://dx.doi.org/10.1080/00207168608803517 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page