Results 201 to 210 of about 5,062,072 (216)
Recognizable Picture Languages and Domino Tiling
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Latteux
exaly +2 more sources
Some of the next articles are maybe not open access.
On Some Recognizable Picture-Languages
Lecture Notes in Computer Science, 1998We 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.
Klaus Reinhardt
exaly +3 more sources
A Characterization of Recognizable Picture Languages
Lecture Notes in Computer Science, 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
exaly +3 more sources
Local and Recognizable Iso Picture Languages
Lecture Notes in Computer Science, 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 ...
V R Dare, T Kalyani, D G Thomas
exaly +3 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 +3 more sources
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 +3 more sources
Classification of String Languages via Tiling Recognizable Picture Languages
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 ...
Anselmo, M +2 more
openaire +1 more source
Recognizability of Triangular Picture Languages by Triangular Wang Automata
2014Wang 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 +3 more
openaire +2 more sources
Recognizable vs. Regular Picture Languages
2007The 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
2016We 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 +2 more sources

