2 search results - page 1 / 1 » Cellular Automata: Real-Time Equivalence Between One-Dimensi... |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...