Results 151 to 160 of about 124,772 (181)
Some of the next articles are maybe not open access.
RECOGNIZABLE PICTURE LANGUAGES
Series in Machine Perception and Artificial Intelligence, 1992The purpose of this paper is to propose a new notion of recognizability for picture (two-dimensional) languages extending the characterization of one-dimensional recognizable languages in terms of local languages and alphabetic mappings. We first introduce the family of local picture languages (denoted by LOC) and, in particular, prove the ...
Dora Giammarresi, Antonio Restivo
exaly +2 more sources
Reducing Local Alphabet Size in Recognizable Picture Languages
Lecture Notes in Computer Science, 2021A recognizable picture language is defined as the projection of a local picture language defined by a set of two-by-two tiles, i.e. by a strictly-locally-testable (SLT) language of order 2. The family of recognizable picture languages is also defined, using larger k by k tiles, \(k>2\), by the projection of the corresponding SLT language.
Stefano Crespi Reghizzi +2 more
exaly +2 more sources
Classification of String Languages via Tiling Recognizable Picture Languages
Lecture Notes in Computer Science, 2011We introduce the definition of string language S recognized via picture language P and prove that there is a one-to-one correspondence between a linear bounded automaton (LBA) for S and a tiling system for P. As consequence tiling systems become an alternative description for LBA that possibly exploits some geometric properties of lines and shapes ...
Marcella Anselmo +2 more
exaly +2 more sources
Fundamenta Informaticae, 2009
In this paper we consider the classes REC1 and UREC1 of unary picture languages that are tiling recognizable and unambiguously tiling recognizable, respectively. By representing unary pictures by quasi-unary strings we characterize REC1 (resp. UREC1) as the class of quasi-unary languages recognized by nondeterministic (resp. unambiguous)
Alberto Bertoni +2 more
exaly +2 more sources
In this paper we consider the classes REC1 and UREC1 of unary picture languages that are tiling recognizable and unambiguously tiling recognizable, respectively. By representing unary pictures by quasi-unary strings we characterize REC1 (resp. UREC1) as the class of quasi-unary languages recognized by nondeterministic (resp. unambiguous)
Alberto Bertoni +2 more
exaly +2 more sources
LEARNING OF RECOGNIZABLE PICTURE LANGUAGES
International Journal of Pattern Recognition and Artificial Intelligence, 1992Learning of certain classes of two-dimensional picture languages is considered in this paper. Linear time algorithms that learn in the limit, from positive data the classes of local picture languages and locally testable picture languages are presented.
Rani Siromoney +3 more
openaire +1 more source
A CHARACTERIZATION OF RECOGNIZABLE PICTURE LANGUAGES
International Journal of Pattern Recognition and Artificial Intelligence, 1992This 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, 2005In 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 +3 more
openaire +1 more source
Recognizability of iso‐picture languages by Wang systems
International Journal of Imaging Systems and Technology, 2009AbstractIn 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 +2 more
openaire +1 more source
Recognizable Picture Languages and Polyominoes
2007We consider the problem of recognizability of some classes of polyominoes in the theory of picture languages. In particular we focus our attention on the problem posed by Matz of finding a nonrecognizable picture language for which his technique for proving the non-recognizability of picture languages fails.
Castiglione G., Vaglica R.
openaire +2 more sources
Local and Recognizable Iso Picture Languages
2004In 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 +2 more
openaire +1 more source