Wang automata are devices for picture language recognition recently introduced by us, which characterize the class REC of recognizable picture languages. Thus, Wang automata are equivalent to tiling systems or online tessellation acceptors, and are based like Wang systems on labeled Wang tiles. The present work focus on scanning strategies, to prove that the ones Wang automata are based on are those following four kinds of movements: boustrophedonic, “L-like”, “U-like”, and spirals.
@article{ITA_2011__45_1_163_0,
author = {Lonati, Violetta and Pradella, Matteo},
title = {Strategies to scan pictures with automata based on Wang tiles},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {45},
year = {2011},
pages = {163-180},
doi = {10.1051/ita/2011016},
mrnumber = {2776859},
zbl = {1219.68100},
language = {en},
url = {http://dml.mathdoc.fr/item/ITA_2011__45_1_163_0}
}
Lonati, Violetta; Pradella, Matteo. Strategies to scan pictures with automata based on Wang tiles. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011) pp. 163-180. doi : 10.1051/ita/2011016. http://gdmltest.u-ga.fr/item/ITA_2011__45_1_163_0/
[1] , and , From determinism to non-determinism in recognizable two-dimensional languages, in Proc. DLT 2007. Lecture Notes in Computer Science 4588 (2007) 36-47. | MR 2380418 | Zbl 1202.68218
[2] , and , Tiling automaton: A computational model for recognizable two-dimensional languages, in Proc. CIAA 2007. Lecture Notes in Computer Science 4783 (2007) 290-302. | MR 2595447 | Zbl 1139.68353
[3] , and , On the complexity of unary tiling-recognizable picture languages. Fundm. Inform. 91 (2009) 231-249. | MR 2516373 | Zbl 1179.68067
[4] and , Deterministically and sudoku-deterministically recognizable picture languages, in Proc. LATA (2007).
[5] and , Recognizable picture series. Journal of Automata, Languages and Combinatorics 10 (2005) 159-183. | MR 2285327 | Zbl 1161.68514
[6] and , Perfectly quilted rectangular snake tilings. Theor. Comput. Sci. 410 (2009) 1486-1494. | MR 2502123 | Zbl 1162.68021
[7] , Solving NP-complete problems in the tile assembly model. Theor. Comput. Sci. 395 (2008) 31-46. | MR 2400999 | Zbl 1145.68018
[8] , , and , A tile-based approach for self-assembling service compositions, in Proc. ICECCS'10. St. Anne's College, University of Oxford (2010).
[9] and , Recognizability of rectangular pictures by Wang systems. Journal of Automata, Languages and Combinatorics 2 (1997) 269-288. | MR 1646448 | Zbl 0908.68109
[10] , and , Design and self-assembly of two-dimensional DNA crystals. Nature 394 (1998) 439-544.
[11] and , Recognizable picture languages. Int. J. Pattern Recogn. Artif. Intell. 6 (1992) 241-256.
[12] and , Two-dimensional languages, in Handbook of Formal Languages 3. A. Salomaa and G. Rozenberg, Eds. Beyond Words, Springer-Verlag, Berlin (1997) 215-267. | MR 1470021 | Zbl 0866.68057
[13] and , Some properties of two-dimensional on-line tessellation acceptors. Inform. Sci. 13 (1977) 95-121. | MR 537582 | Zbl 0371.94067
[14] , and , Complexity of two-dimensional patterns. J. Statist. Phys. 91 (1998) 909-951. | MR 1637266 | Zbl 0917.68156
[15] and , Deterministic recognizability of picture languages with Wang automata. Discrete Mathematics and Theoretical Computer Science (to appear). | MR 2760336 | Zbl 1286.68291
[16] and , Snake-deterministic tiling systems, in Proc. MFCS 2009. Lecture Notes in Computer Science 5734 (2009) 549-560. | MR 2539521 | Zbl 1250.68168
[17] and , Picture recognizability with automata based on Wang tiles, in Proc. SOFSEM 2010. Lecture Notes in Computer Science 5901 (2010) 576-587. | Zbl 1274.68160
[18] , and , The symmetry of the past and of the future: Bi-infinite time in the verification of temporal properties, in Proc. of 6th joint meeting of ESEC/FSE. Dubrovnik, Croatia (2007).
[19] , Proving theorems by pattern recognition II. Bell Systems Technical Journal 40 (1961) 1-42.