Results 1 to 10 of about 124,772 (181)
Recognizable picture languages and domino tiling
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Latteux
exaly +2 more sources
Communication complexity tools on recognizable picture languages
Theoretical Computer Science, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Véronique Terrier
exaly +4 more sources
Context-Sensitive String Languages and Recognizable Picture Languages
Information and Computation, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Latteux, David Simplot
exaly +3 more sources
A characterization of recognizable picture languages by tilings by finite sets
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
Accepting networks of evolutionary picture processors [PDF]
, 2014 We extend the study of networks of evolutionary processors accepting words to a similar model, processing rectangular pictures. To this aim, we introduce accepting networks of evolutionary picture processors and investigate their computational power.
Bottoni, Paolo +2 more
core +4 more sources
ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES [PDF]
International 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
openaire +3 more sources
Deterministic recognizability of picture languages with Wang automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online ...
Violetta Lonati, Matteo Pradella
openaire +6 more sources
Strategies to scan pictures with automata based on Wang tiles [PDF]
, 2011 Wang automata are devices for picture language recognition recently introduced by us, which characterize the class REC of recognizable picture languages. Thus, Wang automata are equivalent to tiling systems or online tessellation acceptors, and are based
M. Pradella, V. Lonati
core +2 more sources
L-Convex Polyominoes are Recognizable in Real Time by 2D Cellular Automata [PDF]
, 2015 A polyomino is said to be L-convex if any two of its cells are connected by a 4-connected inner path that changes direction at most once. The 2-dimensional language representing such polyominoes has been recently proved to be recognizable by tiling ...
AR Smith III +6 more
core +2 more sources
Aesthetic objects, aesthetic judgments and the crafting of organizational style in creative industries [PDF]
, 2020 In this article, we conceptually engage with style as central to creative industries. We specifically argue that style is crafted into being via an interplay between aesthetic judgments and “aesthetic objects.” We define aesthetic objects as temporary ...
Bazin, Yoann, Korica, Maja
core +1 more source