Deterministic recognizability of picture languages with Wang automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Deterministic recognizability of picture languages with Wang automata

Abstract

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 tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacent one, according to some scanning strategy. Wang automata recognize the class REC, i.e. they are equivalent to tiling systems or online tessellation acceptors, and hence strictly more powerful than 4-way automata. We also introduce a natural notion of determinism for Wang automata, and study the resulting class, extending the more traditional approach of diagonal-based determinism, used e. g. by deterministic tiling systems. In particular, we prove that the concept of row (or column) ambiguity defines the class of languages recognized by Wang automata directed by boustrophedonic scanning strategies.
Fichier principal
Vignette du fichier
1471-5709-1-PB.pdf (220.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990448 , version 1 (13-05-2014)

Identifiers

Cite

Violetta Lonati, Matteo Pradella. Deterministic recognizability of picture languages with Wang automata. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 4 (4), pp.73-94. ⟨10.46298/dmtcs.511⟩. ⟨hal-00990448⟩

Collections

TDS-MACS
65 View
743 Download

Altmetric

Share

Gmail Facebook X LinkedIn More