Picture languages: From Wang tiles to 2D grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5725 LNCS, Issue , 2009, Pages 13-46

  Cherubini, Alessandra ^a   Pradella, Matteo ^b  

^a POLITECNICO DI MILANO   (Italy)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

2D GRAMMAR; 2D LANGUAGES; CONTEXT-FREE; PICTURE LANGUAGES; STRING LANGUAGES; WANG TILES;

ALGEBRA; BUILDING MATERIALS; LINGUISTICS;

CONTEXT FREE LANGUAGES;

EID: 70350627337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03564-7_2     Document Type: Conference Paper

References (56)

1. Alstes, A.: Wang tiles for image and texture generation. Technical Report 49432R, Helsinki University of Technology (2004)
2. Anselmo, M., Giammarresi, D., Madonia, M.: New operations and regular expressions for two-dimensional languages over one-letter alphabet. Theor. Comput. Sci. 304, 408-431 (2005)
3. Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 36-47. Springer, Heidelberg (2007)
4. Anselmo, M., Giammarresi, D., Madonia, M.: Tiling automaton: A computational model for recognizable two-dimensional languages. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 290-302. Springer, Heidelberg (2007)
5. Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous recognizable twodimensional languages. Theoretical Informatics and Applications 40(2), 277-293 (2006)
6. Anselmo,M., Jonoska,N.,Madonia,M.:Framedversus unframedtwo-dimensional languages. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM2009. LNCS, vol. 5404, pp. 79-92. Springer, Heidelberg (2009)
7. Anselmo, M., Madonia, M.: Simulating two-dimensional recognizability by pushdown and queue automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 43-53. Springer, Heidelberg (2006)
8. Berger, R.: The Undecidability of the Domino Problem. Memoirs of the AMS, vol. (66). AMS, Providence (1966)
9. Bertoni, A., Goldwurm, M., Lonati, V.: On the complexity of unary tiling-recognizable picture languages. Fundamenta Informaticae 91(2), 231-249 (2009)
10. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: FOCS 1967, pp. 155-160. IEEE Computer Society Press, Los Alamitos (1967)
11. Bozapalidis, S.: Picture deformation. Acta Inf. 45(1), 1-31 (2008)
12. Bozapalidis, S., Grammatikopoulou, A.: Recognizable picture series. Journal of Automata, Languages and Combinatorics 10(2-3), 159-183 (2005)
13. Brun, Y.: Solving NP-complete problems in the tile assembly model. Theor. Comput. Sci. 395(1), 31-46 (2008)
14. Cherubini, A., Crespi Reghizzi, S., Pradella, M.: Regional languages and tiling: A unifying approach to picture grammars. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 253-264. Springer, Heidelberg (2008)
15. Cherubini, A., Crespi Reghizzi, S., Pradella, M., San Pietro, P.: Picture languages: Tiling systems versus tile rewriting grammars. Theor. Comput. Sci. 356(1-2), 90-103 (2006)
16. Choffrut, C., Durak, B.: Collage of two-dimensional words. Theor. Comput. Sci. 340(1), 364-380 (2005)
17. Cohen, M.F., Shade, J., Hiller, S., Deussen, O.: Wang tiles for image and texture generation. ACM Trans. Graph. 22(3), 287-294 (2003)
18. Crespi Reghizzi, S., Pradella, M.: Tile rewriting grammars and picture languages. Theor. Comput. Sci. 340(2), 257-272 (2005)
19. Crespi Reghizzi, S., Pradella, M.: A CKY parser for picture grammars. Information Processing Letters 105(6), 213-217 (2008)
20. Culik II., K.: An aperiodic set of 13 Wang tiles. Discrete Mathematics 160, 245-251 (1996)
21. de Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by Wang systems. Journal of Automata, Languages and Combinatorics 2(4), 269-288 (1997)
22. Drewes, F.: Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid. J. Comput. Syst. Sci. 53(1), 33-66 (1996)
23. Drewes, F., Ewert, S., Klempien-Hinrichs, R., Kreowski, H.-J.: Computing raster images from grid picture grammars. Journal of Automata, Languages and Combinatorics 8(3), 499-519 (2003)
24. Durand, B.: Tilings and quasiperiodicity. Theor. Comput. Sci. 221, 61-75 (1999)
25. Durand, B.: De la logique aux pavages. Theor. Comput. Sci. 281, 311-324 (2002)
26. Durand, B., Levin, L.A., Shen, A.: Local rules and global order, or aperiodic tilings. Math. Intelligencer 27(1), 64-68 (2005)
27. Eigen, S., Navarro, J., Prasad, V.S.: An aperiodic tiling using a dynamical system and Beatty sequences. In: Hasselblatt, B. (ed.) Dynamics, Ergodic Theory and Geometry. Mathematical Sciences Research Institute Publications, vol. (54), pp. 223-241. Cambridge Univ. Press, Cambridge (2007)
28. Finkel, R.A., Bentley, J.L.: Quad trees: A data structure for retrieval on composite keys. Acta Inf. 4, 1-9 (1974)
29. Giammarresi, D.: Tiling recognizable two-dimensional languages. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 75-86. Springer, Heidelberg (2007)
30. Giammarresi, D., Restivo, A.: Recognizable picture languages. International Journal of Pattern Recognition and Artificial Intelligence 6(2-3), 241-256 (1992)
31. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Handbook of formal languages. beyond words, vol. 3, pp. 215-267. Springer, Berlin (1997)
32. Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Inf. Comput. 125(1), 32-45 (1996)
33. Grünbaum, B., Shephard, G.C.: Tilings and Patterns.W.H. Freeman and Company, New York (1987)
34. Gurevich, Y.S., Koriakov, I.O.: Remarks on Berger's paper on the domino problem. Siberian Mathematical Journal 13(2), 319-321 (1972)
35. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13, 95-121 (1977)
36. Inoue, K., Takanami, I.: A survey of two-dimensional automata theory. Information Sciences 55(1-3), 99-121 (1991)
37. Kari, J.: A small aperiodic set ofWang tiles. Discrete Mathematics 160(1-3), 259-264 (1996)
38. Lonati, V., Pradella, M.: Snake-deterministic tiling systems. MFCS 2009 (to appear, 2009)
39. Matz, O.: Regular expressions and context-free grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 283-294. Springer, Heidelberg (1997)
40. Matz, O.: On piecewise testable, starfree, and recognizable picture languages. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 203-210. Springer, Heidelberg (1998)
41. Matz, O.: One quantifier will do in existential monadic second-order logic over pictures. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 751-759. Springer, Heidelberg (1998)
42. Matz, O.: Recognizable vs. Regular picture languages. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 112-121. Springer, Heidelberg (2007)
43. Nivat, M., Saoudi, A., Subramanian, K.G., Siromoney, R., Rajkumar Dare, V.: Puzzle grammars and context-free array grammars. International Journal of Pattern Recognition and Artificial Intelligence 5, 663-676 (1991)
44. Pradella, M., Cherubini, A., Crespi Reghizzi, S.: A unifying approach to context-free picture languages (submitted, 2009)
45. Pradella, M., Crespi Reghizzi, S.: A SAT-based parser and completer for pictures specified by tiling. Pattern Recognition 41(2), 555-566 (2008)
46. Průša, D.: Two-dimensional context-free grammars. In: Andrejková, G., Krajči, S. (eds.) ITAT 2001, pp. 27-40 (2001)
47. Průša, D.: Two-dimensional Languages. Phd thesis, Charles University, Faculty of Mathematics and Physics, Prague (2004)
48. Radhakrishnan, V., Chakaravarthy, V.T., Krithivasan, K.: Pattern matching in matrix grammars. Journal of Automata, Languages and Combinatorics 3(1), 59-76 (1998)
49. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12, 177-209 (1971)
50. Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theor. Comput. Sci. 218(2), 297-323 (1999)
51. Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Computer Graphics and Image Processing 1(3), 284-307 (1972)
52. Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules. Information and Control 23(5), 447-470 (1973)
53. Wang, H.: Proving theorems by pattern recognition II. Bell Systems Technical Journal 40, 1-42 (1961)
54. Wang, H.: Dominoes and the AEA case of the decision problems. In: Mathematical theory of automata: Symposium on Mathematical Theory of Automata 1963. Brooklyn Polytechnic Institute. Microwave Research Institute. Symposia series, vol. 12, pp. 23-55. Polythechnic Press (1963)
55. Wilke, T.: Star-free picture expressions are strictly weaker than first-order logic. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 347-357. Springer, Heidelberg (1997)
56. Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design and self-assembly of two-dimensional DNA crystals. Nature 394, 439-544 (1998)