"We introduce two new models of two-dimensional computing devices called sgraffito automaton and restarting tiling automaton. The models fulfill two conditions. Firstly, they do not exceed the power of finite-state automata when working over one-dimensional inputs. And secondly, they allow a clear design of important computations. We study properties of the induced families of picture languages. We show that they include strictly REC and that restarting tiling automata are able to simulate sgraffito automata. An interesting family is settled by deterministic sgraffito automata. It can be seen as an alternative to DREC."@en . . "2"^^ . . "New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata" . "21230" . . "two-dimensional languages; automata; family REC; lower bounds on time complexity"@en . . . . "Mr\u00E1z, F." . . "RIV/68407700:21230/12:00200615!RIV13-GA0-21230___" . "[76DB23010E31]" . . "New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata"@en . "New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata"@en . . "Pr\u016F\u0161a, Daniel" . . "1"^^ . . . . . "We introduce two new models of two-dimensional computing devices called sgraffito automaton and restarting tiling automaton. The models fulfill two conditions. Firstly, they do not exceed the power of finite-state automata when working over one-dimensional inputs. And secondly, they allow a clear design of important computations. We study properties of the induced families of picture languages. We show that they include strictly REC and that restarting tiling automata are able to simulate sgraffito automata. An interesting family is settled by deterministic sgraffito automata. It can be seen as an alternative to DREC." . "P(GAP103/10/0783)" . . . "RIV/68407700:21230/12:00200615" . "New Models for Recognition of Picture Languages: Sgraffito and Restarting Tiling Automata" . . "154062" .