Results 161 to 170 of about 124,772 (181)

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

LEARNING OF RECOGNIZABLE PICTURE LANGUAGES

Series in Machine Perception and Artificial Intelligence, 1994
Rani Siromoney, Lisa Mathew, K G Subramanian   +2 more
exaly  

A CHARACTERIZATION OF RECOGNIZABLE PICTURE LANGUAGES

Series in Machine Perception and Artificial Intelligence, 1994
Katsushi Inoue, Itsuo Takanami
exaly  

A characterization of recognizable picture languages

Lecture Notes in Computer Science, 2005
Katsushi Inoue, Itsuo Takanami
exaly  

The growth function of S-recognizable sets

Theoretical Computer Science, 2011
Emilie Charlier, Narad Rampersad
exaly