Complete Symmetry in D2L Systems and Cellular Automata

Share/Save/Bookmark

Asveld, Peter R.J. (1985) Complete Symmetry in D2L Systems and Cellular Automata. [Report]

[img]
Preview
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:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66051
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page