Results 211 to 220 of about 4,040 (235)

A CHARACTERIZATION OF RECOGNIZABLE PICTURE LANGUAGES

International Journal of Pattern Recognition and Artificial Intelligence, 1992
This paper first shows that REC, the family of recognizable picture languages in Giammarresi and Restivo,3 is equal to the family of picture languages accepted by two-dimensional on-line tessellation acceptors in Inoue and Nakamura.5 By using this result, we then solve open problems in Giammarresi and Restivo,3 and show that (i) REC is not closed ...
Katsushi Inoue, Itsuo Takanami
openaire   +1 more source

LOCAL AND RECOGNIZABLE HEXAGONAL PICTURE LANGUAGES

International Journal of Pattern Recognition and Artificial Intelligence, 2005
In this paper we consider hexagonal arrays on triangular grids and introduce hexagonal local picture languages and hexagonal tiling systems defining hexagonal recognizable picture languages, motivated by an analogous study of rectangular arrays by Giammarresi and Restivo.
K. S. Dersanambika, Kamala Krithivasan, Carlos Martín-Vide, K. G. Subramanian 0001   +3 more
openaire   +1 more source

Recognizability of iso‐picture languages by Wang systems

International Journal of Imaging Systems and Technology, 2009
AbstractIn the context of a syntactic approach to pattern recognition, there have been several studies in the last few decades ontheoretical models for generating or recognizing two‐dimensional objects, pictures, and picture languages. Motivated by these studies, we have introduced a new notion of recognizability for a class of picture languages called
T. Kalyani, V. Rajkumar Dare, D. Gnanaraj Thomas   +2 more
openaire   +1 more source

Local and Recognizable Iso Picture Languages

2004
In the context of a syntactic approach to pattern recognition, there have been several studies in the last few decades on theoretical models for generating or recognizing two-dimensional objects, pictures and picture languages. Motivated by these studies we introduce a new notion of recognizability for a class of picture languages called iso picture ...
T. Kalyani, V. Rajkumar Dare, D. Gnanaraj Thomas   +2 more
openaire   +1 more source

On some recognizable picture-languages

1998
We show that the language of pictures over {a, b}, where all occurring b's are connected is recognizable, which solves an open problem in [Mat98]. We generalize the used construction to show that monocausal deterministically recognizable picture languages are recognizable, which is surprisingly nontrivial.
openaire   +1 more source

Recognizability of Triangular Picture Languages by Triangular Wang Automata

2014
Wang automata to recognize rectangular picture languages and iso-picture languages were studied in [6, 7]. In this paper we introduce triangular Wang automata based on triangular Wang tiles to recognize triangular picture languages. We discuss scanning strategies and prove that triangular Wang automata with a specific scanning strategy recognize the ...
V. Devi Rajaselvi, T. Kalyani, V. Rajkumar Dare, D. Gnanaraj Thomas   +3 more
openaire   +1 more source

Recognizable vs. Regular Picture Languages

2007
The class of regular word languages plays a central role in formal language theory. Considerable effort has been made to transfer definitions and applications from word languages to their two-dimensional analog, the picture languages, where one considers (two-dimensional) matrices rather than (one-dimensional) words.
openaire   +1 more source

$$+\omega $$ + ω -Picture Languages Recognizable by Büchi-Tiling Systems

2016
We consider \(+\omega \)-pictures, i.e., 2-dimensional pictures with a finite number of rows and a countably infinite number of columns. We extend conventional tiling systems with a Buchi acceptance condition and define the class of Buchi-tiling recognizable \(+\omega \)-picture languages.
Parvaneh Babari, Nicole Schweikardt
openaire   +1 more source

EXPLORING INSIDE TILING RECOGNIZABLE PICTURE LANGUAGES TO FIND DETERMINISTIC SUBCLASSES

International Journal of Foundations of Computer Science, 2011
Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless family REC is not closed under complementation and this implies that it is intrinsically non-deterministic.
openaire   +4 more sources

Some Properties of Unambiguously Hexagonal Tiling Recognizable Picture Languages

International Journal of Mathematics Trends and Technology, 2018
Jaya Abraham, Dersana mbika K.S
openaire   +1 more source