Name
Abstract | ||
|---|---|---|
In this paper we consider several notions of alternation in cellular automata: non-uniform, uniform and weak alternation. We study relations among these notions and with alternating Turing machines. It is proved that the languages accepted in polynomial time by alternating Turing machines are those accepted by alternating cellular automata in polynomial time for all the proposed alternating cellular automata. In particular, this is true for the weak model where the difference between existential and universal states is omitted for all the cells except the first one. It is proved that real time alternation in cellular automata is strictly more powerful than real time alternation in Turing machines, with only one read-write tape. Moreover, it is shown that in linear time uniform and weak models agree. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0304-3975(96)00214-9 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
cellular automaton,Cellular automata,Nondeterminism,Alternation,nondeterminism,alternation,cellular automata | Journal | 180 |
Issue | ISSN | Citations |
1-2 | Theoretical Computer Science | 6 |
PageRank | References | Authors |
0.90 | 7 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martín Matamala | 1 | 158 | 21.63 |