Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 3:37:21 PM
Last modification on : Wednesday, December 8, 2021 - 9:22:03 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:14:54 PM


Files produced by the author(s)




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



Record views


Files downloads