Abstract
A polyomino is a finite connected union of cells having no cut points. Tiling and Wang recognizability of convex polyominoes have been studied in detail by De Carli et al. In this paper we define 2D polyomino online tessellation automaton to recognize a class of polyominoes and prove that the family of various classes of polyominoes recognized by tiling systems and 2D-polyomino online tessellation automata coincide. We also study the recognizability of convex polyominoes by domino systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: IEEE Symposium on Switching and Automata Theory, pp. 155–160 (1967)
De Carli, F., Frosini, A., Rinaldi, S., Vuillon, L.: How to construct convex polyominoes on DNA Wang tiles? LAMA report, Lama-Univ. Savoie, France (2009)
De Carli, F., Frosini, A., Rinaldi, S., Vuillon, L.: On the tiling system recognizability of various classes of convex polyominoes. Annals of Combinatorics 13, 169–191 (2009)
Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 3, pp. 215–267. Springer, Heidelberg (1997)
Castiglione, G., Vaglica, R.: Recognizable picture languages and polyominoes. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 160–171. Springer, Heidelberg (2007)
Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences 13, 95–121 (1977)
Latteux, M., Simplot, D.: Recognizable picture languages and domino tiling. Theoretical Computer Science 178, 275–283 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geetha, H., Thomas, D.G., Kalyani, T. (2010). Online Tessellation Automaton Recognizing Various Classes of Convex Polyominoes. In: Barneva, R.P., Brimkov, V.E., Hauptman, H.A., Natal Jorge, R.M., Tavares, J.M.R.S. (eds) Computational Modeling of Objects Represented in Images. CompIMAGE 2010. Lecture Notes in Computer Science, vol 6026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12712-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-12712-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12711-3
Online ISBN: 978-3-642-12712-0
eBook Packages: Computer ScienceComputer Science (R0)