IS = { zkontrolovano 25 Jan 2014 },
  UPDATE  = { 2014-01-20 },
  author = {Pr{\r u}{\v s}a, Daniel and Mr{\' a}z, Franti{\v s}ek},
  title = {Restarting Tiling Automata},
  journal = {International Journal of Foundations of Computer Science},
  issn = {0129-0541},
  volume = {24},
  number = {06},
  doi = {10.1142/S0129054113400236},
  url = {http://www.worldscientific.com/doi/abs/10.1142/S0129054113400236},
  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
  keywords = {two-dimensional languages, tiling systems, restarting automata},
  publisher = {World Scientific},
  address = {Singapore, Singapore},
  pages = {863--878},
  year = {2013},
  month = {September},
  project = {GACR P103/10/0783},