IS = { zkontrolovano 14 Jan 2013 },
  UPDATE  = { 2012-10-01 },
  author = {Pr{\r u}{\v s}a, Daniel and Mr{\' a}z, Franti{\v s}ek},
  title = {Restarting Tiling Automata},
  booktitle = {Implementation and Application of Automata},
  series = {Lecture Notes in Computer Science},
  editor = {Moreira, Nelma and Reis, Rog\'{e}rio},
  publisher = {Springer-Verlag},
  address = {Heidelberg, Germany},
  book_pages = {368},
  isbn = {978-3-642-31605-0},
  year = {2012},
  month = {July},
  day = {17-20},
  venue = {Porto, Portugal},
  pages = {289--300},
  volume = {7381},
  url = {http://dx.doi.org/10.1007/978-3-642-31606-7_25},
  annote = {We present a new model of a two-dimensional computing
    device called restarting tiling automaton. The automaton defines a
    set of tile-rewriting, weight-reducing rules and a scanning
    strategy by which a tile to rewrite is being searched. We
    investigate properties of the induced families of picture
    languages. Special attention is paid to picture languages that can
    be accepted independently of the scanning strategy. We show that
    this family strictly includes REC and exhibits similar closure
    properties. Moreover, we prove that its intersection with the set
    of one-row languages coincides with the regular languages.},
  authorship = {50-50},
  project = {GACR P103/10/0783},
  keywords = {two-dimensional languages, tiling systems, restarting automata},