10 search results - page 1 / 2 » Bounds on Non-surjective Cellular Automata |
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
IFIPTCS
2000
13 years 8 months ago
2000
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This ...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
TCS
2011
12 years 12 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...