47 search results - page 1 / 10 » Changing the Neighborhood of Cellular Automata |
68
Voted
MCU
2007
15 years 1 months ago
2007
94
Voted
STACS
2005
Springer
15 years 5 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...
110
Voted
MFCS
2007
Springer
15 years 5 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...
JAC
2008
15 years 1 months ago
2008
Abstract. We consider simulations of graph automata. We introduce two local transformations on the neighborhood: splitting and merging. We explain how to use such transformations, ...
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise w...