P. Aigrain and D. Beauquier, Polyomino tilings, cellular automata and codicity, Theoretical Computer Science, vol.147, issue.1-2, pp.165-180, 1995.
DOI : 10.1016/0304-3975(94)00201-S

URL : https://doi.org/10.1016/0304-3975(94)00201-s

M. Anselmo, D. Giammarresi, and M. Madonia, Deterministic and unambiguous families within recognizable two-dimensional languages. Fund, Inform, vol.98, issue.2-3, pp.143-166, 2010.
DOI : 10.1051/ita:2006008

M. Anselmo, D. Giammarresi, and M. Madonia, Strong Prefix Codes of Pictures, Procs. CAI2013, pp.47-59, 2013.
DOI : 10.1007/978-3-642-40663-8_6

M. Anselmo, D. Giammarresi, and M. Madonia, Two Dimensional Prefix Codes of Pictures, Procs. DLT2013. pp, pp.46-57, 2013.
DOI : 10.1007/978-3-642-38771-5_6

M. Anselmo, D. Giammarresi, and M. Madonia, Structure and Measure of a Decidable Class of Two-dimensional Codes, Procs. LATA2015, pp.315-327, 2015.
DOI : 10.1007/978-3-319-15579-1_24

M. Anselmo, D. Giammarresi, M. Madonia, and A. Restivo, Unambiguous recognizable two-dimensional languages, RAIRO - Theoretical Informatics and Applications, vol.510, issue.2, pp.227-294, 2006.
DOI : 10.1007/3-540-54233-7_154

M. Anselmo, D. Giammarresi, and M. Madonia, PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES, International Journal of Foundations of Computer Science, vol.218, issue.2, pp.1017-1032, 2014.
DOI : 10.1016/S0304-3975(98)00328-4

M. Anselmo, D. Giammarresi, and M. Madonia, Picture codes and deciphering delay, Information and Computation, vol.253, 2017.
DOI : 10.1016/j.ic.2016.06.003

M. Anselmo, D. Giammarresi, and M. Madonia, Structure and properties of strong prefix codes of pictures, Mathematical Structures in Computer Science, vol.98, issue.02, pp.123-142, 2017.
DOI : 10.1016/S0304-3975(03)00029-X

M. Anselmo, N. Jonoska, and M. Madonia, Framed Versus Unframed Two-Dimensional Languages, pp.79-92, 2009.
DOI : 10.1007/BF01418780

M. Anselmo and M. Madonia, Two-dimensional comma-free and cylindric codes, Theoretical Computer Science, vol.658, pp.4-17, 2017.
DOI : 10.1016/j.tcs.2016.06.016

E. Barcucci, A. Bernini, S. Bilotta, and R. Pinzani, Cross-bifix-free sets in two dimensions, Theoretical Computer Science, vol.664, pp.29-38, 2017.
DOI : 10.1016/j.tcs.2015.08.032

D. Beauquier and M. Nivat, A codicity undecidable problem in the plane, Theoretical Computer Science, vol.303, issue.2-3, pp.417-430, 2003.
DOI : 10.1016/S0304-3975(03)00029-X

J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata, 2009.
DOI : 10.1017/CBO9781139195768

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

M. Blum and C. Hewitt, Automata on a 2-dimensional tape, 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), pp.155-160, 1967.
DOI : 10.1109/FOCS.1967.6

S. Bozapalidis and A. Grammatikopoulou, Picture codes, RAIRO - Theoretical Informatics and Applications, vol.33, issue.4, pp.537-550, 2006.
DOI : 10.1016/0304-3975(84)90100-2

D. Giammarresi and A. Restivo, Two-Dimensional Languages, pp.215-268, 1997.
DOI : 10.1007/978-3-642-59126-6_4

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

A. Grammatikopoulou, Prefix picture sets and picture codes, Procs. CAI'05, pp.255-268, 2005.

J. Kari and V. Salo, A Survey on Picture-Walking Automata, Algebraic Foundations in Computer Science, pp.183-213, 2011.
DOI : 10.1016/0020-0255(92)90068-J

M. Kolarz and W. Moczurad, Multiset, Set and Numerically Decipherable Codes over Directed Figures, LNCS, vol.7643, pp.224-235, 2012.
DOI : 10.1007/978-3-642-35926-2_25

M. Moczurad and W. Moczurad, Some open problems in decidability of brick (labeled polyomino) codes, COCOON 2004, pp.72-81, 2004.

F. Otto and F. Mráz, Deterministic ordered restarting automata for picture languages, Acta Informatica, vol.1, issue.3, pp.593-623, 2015.
DOI : 10.1016/S0146-664X(72)80019-4

M. Pradella, A. Cherubini, and S. Crespi-reghizzi, A unifying approach to picture grammars, Information and Computation, vol.209, issue.9, pp.1246-1267, 2011.
DOI : 10.1016/j.ic.2011.07.001

D. Simplot, A characterization of recognizable picture languages by tilings by finite sets, Theoretical Computer Science, vol.218, issue.2, pp.297-323, 1991.
DOI : 10.1016/S0304-3975(98)00328-4