IS = { zkontrolovano 24 Jan 2014 },
  UPDATE  = { 2013-09-25 },
  author = {Pr{\r u}{\v s}a, Daniel and Mr{\' a}z, Franti{\v s}ek and Otto, Friedrich},
  title = {New Results on Deterministic Sgraffito Automata},
  booktitle = {DLT 2013: Proceedings of the 17th International Conference on 
    Developments in Language Theory},
  book_pages = {460},
  series = {Lecture Notes in Computer Science},
  editor = {B{\' e}al, Marie-Pierre and Carton, Olivier},
  year = {2013},
  isbn = {978-3-642-38770-8},
  volume = {7907},
  doi = {10.1007/978-3-642-38771-5_36},
  url = {http://dx.doi.org/10.1007/978-3-642-38771-5_36},
  annote = {The deterministic sgraffito automaton is a two-dimensional
    computing device that allows a clear and simple design of
    important computations. The family of picture languages it accepts
    has many nice closure properties, but when restricted to one-row
    inputs (that is, strings), this family collapses to the class of
    regular languages. Here we compare the deterministic sgraffito
    automaton to some other two-dimensional models: the
    two-dimensional deterministic forgetting automaton, the four-way
    alternating automaton and the sudoku-deterministically
    recognizable picture languages. In addition, we prove that
    deterministic sgraffito automata accept some unary picture
    languages that are outside the class REC of recognizable picture
  publisher = {Springer-Verlag},
  address = {Berlin, Heidelberg, Germany},
  keywords = {picture languages, sgraffito automaton, 
    recognizable picture languages},
  pages = {409--419},
  venue = {Marne-la-Vall{\' e}e, France},
  year = {2013},
  month = {June},
  day = {18-21},
  project = {GACR P103/10/0783},