Picture Recognizability with Automata Based on Wang Tiles

We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang systems. Wang automata combine features of both online tessellation acceptors and 4-ways 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. We prove that 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 consider a very natural notion of determinism for Wang automata, and study the resulting class, comparing it with other deterministic classes considered in the literature, like DREC and Snake-DREC.

• Type: Conference
• Year: 2010
• Where: SOFSEM
• Authors: Violetta Lonati, Matteo Pradella
• Keywords: 4-way Automata, Online Tessellation Acceptors, SOFSEM 2010, Theoretical Computer Science, Wang Automata Combine