Here we present an automata model for the recognizability of hexagonal picture languages, called Hexagonal Wang automata (HWA), which is based on a variant of hexagonal Wang tiles. We provide wide range of polite scanning strategies and prove that the non deterministic HWA with any polite scanning strategy are equivalent to Hexagonal Tiling Systems or Hexagonal online Tessellation Acceptors. We also introduce the notion of deterministic recognizability in HWA and present some comparison results.

 

Key words: Hexagonal picture languages, hexagonal Wang system, scanning strategy, determinism.