M. Anselmo, D. Giammarresi, M. Madonia, and A. Restivo, Unambiguous recognizable two-dimensional languages, vol.40, pp.277-293, 2006.

M. Anselmo and M. Madonia, Classes of two-dimensional languages and recognizability conditions, RAIRO -Theoretical Informatics and Applications, vol.44, issue.4, pp.471-488, 2010.

M. Anselmo and M. Madonia, A stronger recognizability condition for twodimensional languages, Discrete Mathematics & Theoretical Computer Science, vol.15, issue.2, pp.139-156, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00980763

D. Giammarresi and A. Restivo, Recognizable picture languages, vol.IJPRAI, pp.241-256, 1992.

D. Giammarresi and A. Restivo, Matrix-based complexity functions and recognizable picture languages, Logic and Automata: History and Perspectives, pp.307-330, 2008.

D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas, Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Information and Computation, vol.125, pp.32-45, 1996.

E. Grandjean and F. Olive, A logical approach to locality in pictures languages, Journal of Computer and System Sciences, vol.82, issue.6, pp.959-1006, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00786148

P. Guillon and E. Jeandel, Infinite Communication Complexity. arXiv preprint, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01108690

J. Hromkovic, S. Seibert, and J. Karhumäki, Hartmut Klauck, and Georg Schnitger. Communication complexity method for measuring nondeterminism in finite automata. Information and Computation, vol.172, pp.202-217, 2002.

K. Inoue and I. Takanami, A characterization of recognizable picture languages, IJPRAI, vol.8, issue.2, pp.501-508, 1994.

E. Kushilevitz and N. Nisan, Communication complexity, 1997.

K. Lindgren, C. Moore, and M. Nordahl, Complexity of two-dimensional patterns, Journal of Statistical Physics, vol.91, issue.5, pp.909-951, 1998.

O. Matz, On piecewise testable, starfree, and recognizable picture languages, Foundations of Software Science and Computation Structure, pp.203-210, 1998.

W. Thomas, S. Seibert, and A. Potthoff, Nondeterminism versus determinism of finite automata over directed acyclic graphs, Bulletin of the Belgian Mathematical Society-Simon Stevin, vol.1, issue.2, pp.285-298, 1994.

A. Yao, Some complexity questions related to distributive computing, Proceedings of the 11h Annual ACM Symposium on Theory of Computing, pp.209-213, 1979.