“…Regular picture languages can equivalently be described in terms of automata, sets of tiles, rational operations, or monadic second order logic Inoue and Nakamura, 1977;Latteux and Simplot, 1997). The extension of regular picture languages to the quantitative setting led to the definition of recognizable picture series whose theoretical study has been of recent interest (Bozapalidis and Grammatikopoulou, 2005;Mäurer, 2005;Fichtner, 2011;Babari and Droste, 2015). Recognizable picture series were first introduced in (Bozapalidis and Grammatikopoulou, 2005) by means of Weighted Picture Automata.…”