R. Alur, L. D-'antoni, J. Deshmukh, M. Raghothaman, and Y. Yuan, Regular functions and cost register automata. In: LICS'13, pp.13-22, 2013.

C. Dyer, One-way bounded cellular automata, Information and Control, vol.44, issue.3, pp.261-281, 1980.
DOI : 10.1016/S0019-9958(80)90164-3

P. Dymond, Indirect addressing and the time relationships of some models of sequential computation, Computers & Mathematics with Applications, vol.5, issue.3, pp.193-209, 1979.
DOI : 10.1016/0898-1221(79)90042-7

P. Fischer, A. Meyer, and A. Rosenberg, Counter machines and counter languages, Mathematical Systems Theory, vol.14, issue.3, pp.265-283, 1968.
DOI : 10.1145/321420.321423

E. Goles, N. Ollinger, and G. Theyssier, Introducing Freezing Cellular Automata In: Cellular Automata and Discrete Complex Systems, TUCS Lecture Notes, vol.24, pp.65-73, 2015.

L. Hella, M. Järvisalo, A. Kuusisto, J. Laurinharju, T. Lempiäinen et al., Weak models of distributed computing, with connections to modal logic, Distributed Computing, vol.10, issue.9, pp.31-53, 2015.
DOI : 10.1109/71.798313

N. Immerman, Descriptive complexity. Graduate texts in computer science, 1999.

J. Kari, Theory of cellular automata: A survey, Theoretical Computer Science, vol.334, issue.1-3, pp.3-33, 2005.
DOI : 10.1016/j.tcs.2004.11.021

M. Kutrib, 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 and A. Malcher, Cellular automata with sparse communication, Theor. Comp. Sci, vol.411, pp.38-39, 2010.

A. Kuusisto, Modal logic and distributed message passing automata, CSL'13. LIPIcs, pp.452-468, 2013.

A. Kuusisto and F. Reiter, Emptiness Problems for Distributed Automata, Electronic Proceedings in Theoretical Computer Science, vol.45, issue.2, pp.210-222, 2017.
DOI : 10.1145/2431211.2431223

N. Lynch, Distributed Algorithms, 1996.

A. Malcher, Descriptional complexity of cellular automata and decidability questions, Journal of Automata, Languages and Combinatorics, vol.7, issue.4, pp.549-560, 2002.

M. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines, The Annals of Mathematics, vol.74, issue.3, pp.437-455, 1961.
DOI : 10.2307/1970290

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Applications Society for Industrial and Applied Mathematics (SIAM), vol.5, 2000.
DOI : 10.1137/1.9780898719772

H. Petersen, SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES, International Journal of Foundations of Computer Science, vol.14, issue.02, pp.395-409, 2011.
DOI : 10.2307/1970290

F. Reiter, Asynchronous distributed automata: A characterization of the modal mu-fragment, ICALP'17. LIPIcs, pp.1-10014, 2017.

S. Seidel, Language recognition and the synchronization of cellular automata, 1979.

V. Terrier, Language Recognition by Cellular Automata, In: Handbk. of Nat. Comp, pp.123-158, 2012.
DOI : 10.1007/978-3-540-92910-9_4

URL : https://hal.archives-ouvertes.fr/hal-01086432

R. Vollmar, On Cellular Automata with a Finite Number of State Changes, Parallel Processes and Related Automata, pp.181-191, 1981.
DOI : 10.1007/978-3-7091-8596-4_13

R. Vollmar, Some remarks about the ???efficiency??? of polyautomata, International Journal of Theoretical Physics, vol.9, issue.12, pp.1007-1015, 1982.
DOI : 10.1007/978-3-7091-8596-4_13