{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:00:35Z","timestamp":1648670435361},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p> We consider directed figures defined as labelled polyominoes with designated start and end points, with a partial catenation. As we are interested in codicity verification for sets of figures, we show that it is decidable for sets of figures with parallel translation vectors, which is one of the decidability border cases in this setting. We give a constructive proof which leads to a straightforward algorithm. <\/jats:p>","DOI":"10.1142\/s1793830910000814","type":"journal-article","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T03:21:26Z","timestamp":1295234486000},"page":"469-481","source":"Crossref","is-referenced-by-count":0,"title":["DIRECTED FIGURE CODES: DECIDABILITY FRONTIER"],"prefix":"10.1142","volume":"02","author":[{"given":"MICHA\u0141","family":"KOLARZ","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Jagiellonian University, \u0141ojasiewicza 6, 30-348 Krak\u00f3w, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00201-S"},{"key":"rf2","volume-title":"Theory of Codes","author":"Berstel J.","year":"1985"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00029-X"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.028"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2007019"},{"key":"rf6","author":"Kolarz M.","journal-title":"Theor. Inform. Appl. RAIRO"},{"key":"rf7","first-page":"1","volume":"11","author":"Kolarz M.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00317-5"},{"key":"rf9","doi-asserted-by":"crossref","unstructured":"M.\u00a0Moczurad and W.\u00a0Moczurad, Mathematics and Computer Science III (Algorithms, Trees, Combinatorics and Probabilities). Trends in Mathematics (Birkh\u00e4user, 2004)\u00a0pp. 541\u2013542.","DOI":"10.1007\/978-3-0348-7915-6_53"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:15:51Z","timestamp":1565097351000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,6]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S1793830910000814"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000814","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}