A characterization of recognizable picture languages by tilings by finite sets

Theoretical Computer Science

Volumn 218, Issue 2, 1999, Pages 297-323

  Simplot, David ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347026522     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00328-4     Document Type: Article

References (19)

1. D. Beauquier, M. Nivat, Tiling the plane with one tile, in: Proc. 6th Annual Symp. on Computational Geometry (SGC'90), ACM Press, Berkeley, CA, 1990, pp. 128-138.
2. D. Beauquier, M. Nivat, E. Rémila, M. Robson, Tiling pictures of the plane with two bars, a horizontal and a vertical one, Comput. Geom. Theory Appl. 5 (1995) 1-25.
3. J. Berstel, Transductions and Context-Free Languages, Teubner Studienbücher, Stuttgart, 1979.
4. K. Culik II, F.E. Fich, A. Salomaa, A Homomorphic characterization of regular languages, Discrete Appl. Math. 4 (1982) 149-152.
5. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974.
6. D. Giammarresi, A. Restivo, Recognizable picture languages, Internat. J. Pattern Recognition Artif. Intell. 6 (2-3) (1992) 241-256. M. Nivat, A. Saoudi, P.S.P. Wangs (Eds.), Special Issue on Parallel Image Processing.
7. D. Giammarresi, A. Restivo, Two-dimensional finite state recognizability, Fund. Inform. 25(3-4) (1996) 399-422. Special issue: Formal Language Theory.
8. D. Giammarresi, A. Restivo, Two-dimensional languages, in: A. Salomaa, G. Rozenberg (Eds.), Handbook of Formal Languages, vol. 3, Springer, Berlin, 1996, 215-267.
9. D. Giammarresi, A. Restivo, S. Seibert, W. Thomas, Monadic second-order logic over rectangular pictures and recognizability by tiling systems, Inform. Comput. 125 (1) (1996) 32-45.
10. S.W. Golomb, Tiling with polyominoes, J. Combin. Theory 1 (1966) 280-296.
11. S.W. Golomb, Tiling with sets of polyominoes, J. Combin. Theory, 9 (1970) 60-71.
12. B. Grünbaum, G.C. Shepard, Tilings and Patterns, Freeman, New York, 1986.
13. K. Inoue, I. Takanami, A characterization of recognizable picture languages, in: Proc. 2nd Internat. Colloquium on Parallel Image Processing, Lecture Notes in Computer Science, vol. 654, Springer, Berlin, 1991, pp. 133-143.
14. J. Karhumäki, M. Linna, A note on morphic characterization of languages, Discrete Appl. Math. 5 (1983) 243-246.
15. M. Latteux, J. Leguy, On composition of morphisms and inverse morphisms, Lecture Notes in Computer Science, vol. 154, 1993, Springer, Berlin, pp. 420-432.
16. M. Latteux, D. Simplot, Recognizable picture languages and domino tiling, Theoret. Comput. Sci. 178(1-2) (1997) 275-283.
17. K. Lindgren, C. Moore, M. Nordahl, Complexity of two-dimensional patterns, Technical Report 97-03-023, Santa Fe Institute, Unit. States, 1997.
18. O. Matz, Regular expressions and context-free grammars for picture languages, in: Proc. 14th Annual Symp. on Theoretical Aspects of Computer Science (STACS'97), Lecture Notes in Computer Science, vol. 1200, Springer, Berline, 1997, pp. 283-294.
19. P. Turakainen, A homomorphic characterization of principal semi-AFLs without using intersection with regular sets, Inform. Sci. 27 (1982) 141-149.