J. H. Chang, O. H. Ibarra, and M. A. Palis, Parallel Parsing on a One-Way Array of Finite-State Machines, IEEE Transactions on Computers, vol.36, issue.1, pp.64-75, 1987.
DOI : 10.1109/TC.1987.5009449

C. Choffrut and K. C. Ii, On real-time cellular automata and trellis automata, Acta Informatica, vol.21, issue.4, pp.393-407, 1984.
DOI : 10.1007/BF00264617

S. N. Cole, Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Trans. Comput. C, vol.18, issue.4, pp.349-365, 1969.
DOI : 10.1109/swat.1966.17

P. C. Fischer, Generation of Primes by a One-Dimensional Real-Time Iterative Array, Journal of the ACM, vol.12, issue.3, pp.388-394, 1965.
DOI : 10.1145/321281.321290

O. H. Ibarra and M. A. Palis, Some results concerning linear iterative (systolic) arrays, Journal of Parallel and Distributed Computing, vol.2, issue.2, pp.182-218, 1985.
DOI : 10.1016/0743-7315(85)90034-6

O. H. Ibarra and M. A. Palis, Two-dimensional iterative arrays: Characterizations and applications, Theoretical Computer Science, vol.57, issue.1, pp.47-86, 1988.
DOI : 10.1016/0304-3975(88)90163-6

URL : https://doi.org/10.1016/0304-3975(88)90163-6

M. Kutrib, G. Bel-enguix, M. D. Jiménez-lópez, and C. Martín-vide, Cellular Automata ??? A Computational Point of View, New Developments in Formal Languages and Applications, pp.183-227, 2008.
DOI : 10.1007/978-3-540-78291-9_6

M. Kutrib, Cellular automata and language theory, ) Encyclopedia of Complexity and Systems Science, pp.800-823, 2009.
DOI : 10.1007/978-1-4614-1800-9_25

M. Kutrib and A. Malcher, COMPUTATIONS AND DECIDABILITY OF ITERATIVE ARRAYS WITH RESTRICTED COMMUNICATION, Parallel Processing Letters, vol.58, issue.02, pp.247-264, 2009.
DOI : 10.1145/322047.322058

M. Kutrib and A. Malcher, On One-way One-bit O (One)-message Cellular Automata, Electronic Notes in Theoretical Computer Science, vol.252, pp.77-91, 2009.
DOI : 10.1016/j.entcs.2009.09.015

URL : https://doi.org/10.1016/j.entcs.2009.09.015

M. Kutrib and A. Malcher, Cellular automata with sparse communication, Theor. Comput. Sci, vol.411, pp.38-39, 2010.
DOI : 10.1007/978-3-642-02979-0_7

URL : http://geb.uni-giessen.de/geb/volltexte/2012/9081/pdf/Ifig_report0903.pdf

M. Kutrib and A. Malcher, One-way cellular automata, bounded languages, and minimal communication, J. Autom. Lang. Comb, vol.15, issue.12, pp.135-153, 2010.

M. Kutrib and A. Malcher, Cellular automata with limited inter-cell bandwidth, Theoretical Computer Science, vol.412, issue.30, pp.3917-3931, 2011.
DOI : 10.1016/j.tcs.2011.02.026

URL : https://doi.org/10.1016/j.tcs.2011.02.026

A. Malcher, On the descriptional complexity of iterative arrays, IEICE Trans. Inf. Syst. E87-D, pp.721-725, 2004.

J. Mazoyer and V. Terrier, Signals in one-dimensional cellular automata, Theoretical Computer Science, vol.217, issue.1, pp.53-80, 1999.
DOI : 10.1016/S0304-3975(98)00150-9

URL : https://doi.org/10.1016/s0304-3975(98)00150-9

I. Smith and A. R. , Real-time language recognition by one-dimensional cellular automata, Journal of Computer and System Sciences, vol.6, issue.3, pp.233-253, 1972.
DOI : 10.1016/S0022-0000(72)80004-7

URL : https://doi.org/10.1016/s0022-0000(72)80004-7

H. Umeo and N. Kamikawa, A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications, Fund. Inform, vol.52, pp.257-275, 2002.

H. Umeo and N. Kamikawa, Real-time generation of primes by a 1-bit-communication cellular automaton. Fund, Inform, vol.58, pp.421-435, 2003.

T. Worsch, Linear Time Language Recognition on Cellular Automata with Restricted Communication, Theoretical Informatics, pp.417-426, 2000.
DOI : 10.1007/10719839_41

URL : https://publikationen.bibliothek.kit.edu/55599/760019