T. Buchholz, A. Klein, and M. Kutrib, Iterative arrays with limited nondeterministic communication cell, Words, Languages and Combinatorics III, pp.73-87, 2003.

T. Buchholz and M. Kutrib, Some relations between massively parallel arrays. Parallel Comput, vol.23, pp.1643-1662, 1997.

S. N. Cole, Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Trans. Comput. C, vol.18, pp.349-365, 1969.

I. I. ?ulik, K. Yu, and S. , Iterative tree automata, Theoret. Comput. Sci, vol.32, pp.227-247, 1984.

P. Duris, J. Hromkovic, J. D. Rolim, and G. Schnitger, Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations, Theoretical Aspects of Computer Science (STACS 1997), vol.1200, pp.117-128, 1997.

C. R. Dyer, One-way bounded cellular automata, Inform. Control, vol.44, pp.261-281, 1980.

H. Fernau, M. Kutrib, and M. Wendlandt, Self-verifying pushdown automata, Non-Classical Models of Automata and Applications (NCMA 2017). books@ocg.at, vol.329, pp.103-117, 2017.

G. Jirásková and G. Pighizzini, Optimal simulation of self-verifying automata by deterministic automata, Inform. Comput, vol.209, pp.528-535, 2011.

M. Kutrib, Cellular automata -a computational point of view, New Developments in Formal Languages and Applications, pp.183-227, 2008.

M. Kutrib, Cellular automata and language theory, Encyclopedia of Complexity and System Science, pp.800-823, 2009.

M. Kutrib, Complexity of one-way cellular automata, Cellular Automata and Discrete Complex Systems (AUTOMATA 2014), vol.8996, pp.3-18, 2015.

M. Kutrib and T. Worsch, Self-verifying cellular automata, Cellular Automata for Research and Industry, vol.11115, pp.340-351, 2018.

J. Mazoyer and V. Terrier, Signals in one-dimensional cellular automata, Theoret. Comput. Sci, vol.217, pp.53-80, 1999.
URL : https://hal.archives-ouvertes.fr/hal-02101868

I. Smith and A. R. , Real-time language recognition by one-dimensional cellular automata, J. Comput. System Sci, vol.6, pp.233-253, 1972.