{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:03:12Z","timestamp":1648728192864},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0129054113400236","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T08:17:54Z","timestamp":1388132274000},"page":"863-878","source":"Crossref","is-referenced-by-count":5,"title":["RESTARTING TILING AUTOMATA"],"prefix":"10.1142","volume":"24","author":[{"given":"DANIEL","family":"PR\u016e\u0160A","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering, Czech Technical University, Karlovo n\u00e1m\u011bst\u00ed 13, 121 35 Prague 2, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANTI\u0160EK","family":"MR\u00c1Z","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 25 Prague 1, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.016"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03564-7_2"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90399-2"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054107004723"},{"key":"p_8","first-page":"576","volume":"5901","author":"Lonati V.","year":"2010","journal-title":"LNCS"},{"key":"p_9","first-page":"225","volume":"6807","author":"Lonati V.","year":"2011","journal-title":"LNCS"},{"key":"p_10","first-page":"125","volume":"4201","author":"Mr\u00e1z F.","year":"2006","journal-title":"LNCS"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-33461-3_11"},{"key":"p_12","first-page":"289","volume":"7381","author":"Pr\u0161a D.","year":"2012","journal-title":"LNCS"},{"key":"p_13","first-page":"251","volume":"7410","author":"Pr\u0161a D.","year":"2012","journal-title":"LNCS"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:10:55Z","timestamp":1565122255000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":10,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2013,12,27]]},"published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1142\/S0129054113400236"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400236","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}