Sciweavers

815 search results - page 5 / 163
» Algebraic Recognizability of Languages
Sort
View
91
Voted
DLT
2007
15 years 2 months ago
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
Marcella Anselmo, Dora Giammarresi, Maria Madonia
114
Voted
DMTCS
2010
137views Mathematics» more  DMTCS 2010»
14 years 10 months ago
Deterministic recognizability of picture languages with Wang automata
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 tessell...
Violetta Lonati, Matteo Pradella
99
Voted
FOSSACS
2000
Springer
15 years 4 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin
98
Voted
CAI
2007
Springer
15 years 2 months ago
Recognizable Picture Languages and Polyominoes
Giusi Castiglione, Roberto Vaglica
80
Voted
ITA
2006
15 years 19 days ago
Unambiguous recognizable two-dimensional languages
Marcella Anselmo, Dora Giammarresi, Maria Madonia,...