Results 191 to 200 of about 5,062,072 (216)

Communication Complexity Tools on Recognizable Picture Languages

open access: yesTheoretical Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Terrier, Véronique, Véronique Terrier
exaly   +7 more sources

Recognizable Picture Languages and Polyominoes

open access: yesLecture Notes in Computer Science, 2007
We 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.
Giuseppa CASTIGLIONE, Roberto Vaglica
exaly   +5 more sources

Recognizable Picture Languages

open access: yesInternational Journal of Pattern Recognition and Artificial Intelligence, 1992
The 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   +6 more sources

On the Complexity of Unary Tiling-Recognizable Picture Languages [PDF]

open access: yesLecture Notes in Computer Science, 2007
We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary strings to represent unary pictures and we prove that any unary picture language L is in Rec1 if and only if the set of all quasi-unary strings encoding the elements of L is ...
Violetta Lonati, Alberto Bertoni
exaly   +4 more sources

On Piecewise Testable, Starfree, and Recognizable Picture Languages [PDF]

open access: yesLecture Notes in Computer Science, 1998
We isolate a technique for showing that a picture language (i.e. a“two-dimensional language/rd) is not recognizable. Then we prove the non-recognizability of a picture language that is both starfree (i.e., definable by means of union, concatenation, and complement) and piecewise testable (i.e., definable by means of allowed subpictures), solving an ...
Oliver Matz
exaly   +4 more sources

A Characterization of Recognizable Picture Languages by Tilings by Finite Sets

open access: yesTheoretical Computer Science, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Simplot, David
exaly   +4 more sources

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

open access: yesFundamenta 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)
Violetta Lonati, Alberto Bertoni
exaly   +4 more sources

On Recognizable Languages of Infinite Pictures [PDF]

open access: yesInternational Journal of Foundations of Computer Science, 2004
In a recent paper, Altenbernd, Thomas and Wöhrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the Büchi and Muller ones, firstly used for infinite words. The authors asked for comparing the tiling system acceptance with an acceptance
Finkel, Olivier
exaly   +8 more sources

Context-Sensitive String Languages and Recognizable Picture Languages

open access: yesInformation and Computation, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Latteux, David Simplot
exaly   +5 more sources
Some of the next articles are maybe not open access.

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.
Kg Subramanian, K Krithivasan
exaly   +2 more sources

Home - About - Disclaimer - Privacy