4 search results - page 1 / 1 » Revisiting the Rice Theorem of Cellular Automata |
STACS
2010
Springer
14 years 5 hour ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of p...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...