Skip to main content Accessibility help
×
Home
Hostname: page-component-768dbb666b-6zkrn Total loading time: 0.358 Render date: 2023-02-06T19:57:50.843Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Strategies to scan pictures with automata based on Wang tiles

Published online by Cambridge University Press:  15 March 2011

Violetta Lonati
Affiliation:
Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Comelico 39/41, 20135 Milano, Italy; lonati@dsi.unimi.it
Matteo Pradella
Affiliation:
IEIIT, Consiglio Nazionale delle Ricerche, Via Golgi 42, 20133 Milano, Italy; pradella@elet.polimi.it
Get access

Abstract

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.

Type
Research Article
Copyright
© EDP Sciences, 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Anselmo, M., Giammarresi, D. and Madonia, M., From determinism to non-determinism in recognizable two-dimensional languages, in Proc. DLT 2007. Lecture Notes in Computer Science 4588 (2007) 3647. CrossRef
Anselmo, M., Giammarresi, D. and Madonia, M., Tiling automaton: A computational model for recognizable two-dimensional languages, in Proc. CIAA 2007. Lecture Notes in Computer Science 4783 (2007) 290302. CrossRef
Bertoni, A., Goldwurm, M. and Lonati, V., On the complexity of unary tiling-recognizable picture languages. Fundm. Inform. 91 (2009) 231249.
B. Borchert and K. Reinhardt, Deterministically and sudoku-deterministically recognizable picture languages, in Proc. LATA (2007).
S. Bozapalidis and A. Grammatikopoulou, Recognizable picture series. Journal of Automata, Languages and Combinatorics 10 (2005) 159–183.
Brijder, R. and Hoogeboom, H.J., Perfectly quilted rectangular snake tilings. Theor. Comput. Sci. 410 (2009) 14861494. CrossRef
Brun, Y., Solving NP-complete problems in the tile assembly model. Theor. Comput. Sci. 395 (2008) 3146. CrossRef
L. Cavallaro, E. Di Nitto, C.A. Furia and M. Pradella, A tile-based approach for self-assembling service compositions, in Proc. ICECCS'10. St. Anne's College, University of Oxford (2010).
L. de Prophetis and S. Varricchio, Recognizability of rectangular pictures by Wang systems. Journal of Automata, Languages and Combinatorics 2 (1997) 269–288.
Winfree, L.W.E., Liu, F. and Seeman, N., Design and self-assembly of two-dimensional DNA crystals. Nature 394 (1998) 439544. CrossRef
Giammarresi, D. and Restivo, A., Recognizable picture languages. Int. J. Pattern Recogn. Artif. Intell. 6 (1992) 241256. CrossRef
D. Giammarresi and A. Restivo, Two-dimensional languages, in Handbook of Formal Languages 3. A. Salomaa and G. Rozenberg, Eds. Beyond Words, Springer-Verlag, Berlin (1997) 215–267.
Inoue, K. and Nakamura, A., Some properties of two-dimensional on-line tessellation acceptors. Inform. Sci. 13 (1977) 95121. CrossRef
Lindgren, K., Moore, C. and Nordahl, M., Complexity of two-dimensional patterns. J. Statist. Phys. 91 (1998) 909951. CrossRef
V. Lonati and M. Pradella, Deterministic recognizability of picture languages with Wang automata. Discrete Mathematics and Theoretical Computer Science (to appear).
Lonati, V. and Pradella, M., Snake-deterministic tiling systems, in Proc. MFCS 2009. Lecture Notes in Computer Science 5734 (2009) 549560. CrossRef
Lonati, V. and Pradella, M., Picture recognizability with automata based on Wang tiles, in Proc. SOFSEM 2010. Lecture Notes in Computer Science 5901 (2010) 576587. CrossRef
M. Pradella, A. Morzenti and P. San Pietro, 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).
Wang, H., Proving theorems by pattern recognition II. Bell Systems Technical Journal 40 (1961) 142. CrossRef

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Strategies to scan pictures with automata based on Wang tiles
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Strategies to scan pictures with automata based on Wang tiles
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Strategies to scan pictures with automata based on Wang tiles
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *