Online tessellation automaton recognizing various classes of convex polyominoes

Authors:
H. Geetha;D. G. Thomas;T. Kalyani
Affiliations:
Department of Mathematics, St. Joseph's College of Engineering, Chennai;Department of Mathematics, Madras Christian College, Chennai;Department of Mathematics, St. Joseph's College of Engineering, Chennai
Venue:
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Year:
2010

Citing 4
Cited 0

Recognizable picture languages and domino tiling

Theoretical Computer Science
Two-dimensional languages

Handbook of formal languages, vol. 3
Automata on a 2-dimensional tape

FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Recognizable picture languages and polyominoes

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics

Quantified Score

Hi-index	0.00

Visualization

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.