{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:45Z","timestamp":1725892605468},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_28","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T01:15:25Z","timestamp":1306545325000},"page":"255-263","source":"Crossref","is-referenced-by-count":0,"title":["Plane-Filling Properties of Directed Figures"],"prefix":"10.1007","author":[{"given":"W\u0142odzimierz","family":"Moczurad","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5187","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular computation of solutions to combinatorial problems. Science\u00a0266(5187), 1021\u20131024 (1994)","journal-title":"Science"},{"issue":"6","key":"28_CR2","doi-asserted-by":"publisher","first-page":"2356","DOI":"10.1137\/080723971","volume":"38","author":"L. Adleman","year":"2009","unstructured":"Adleman, L., Kari, J., Kari, L., Reishus, D., Sosik, P.: The undecidability of the infinite ribbon problem: Implications for computing by self-assembly. SIAM Journal on Computing\u00a038(6), 2356\u20132381 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR3","first-page":"1","volume":"66","author":"R. Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the domino problem. Memoirs of the American Mathematical Society\u00a066, 1\u201372 (1966)","journal-title":"Memoirs of the American Mathematical Society"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/11493785_6","volume-title":"DNA Computing","author":"H.L. Chen","year":"2005","unstructured":"Chen, H.L., Goel, A.: Error free self-assembly using error prone tiles. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 62\u201375. Springer, Heidelberg (2005)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2005.03.028","volume":"337","author":"G. Costagliola","year":"2005","unstructured":"Costagliola, G., Ferrucci, F., Gravino, C.: Adding symbolic information to picture models: definitions and properties. Theoretical Computer Science\u00a0337, 51\u2013104 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1051\/ita\/2011005","volume":"44","author":"M. Kolarz","year":"2010","unstructured":"Kolarz, M.: The code problem for directed figures. Theoretical Informatics and Applications RAIRO\u00a044(4), 489\u2013506 (2010)","journal-title":"Theoretical Informatics and Applications RAIRO"},{"issue":"2","key":"28_CR7","first-page":"1","volume":"11","author":"M. Kolarz","year":"2009","unstructured":"Kolarz, M., Moczurad, W.: Directed figure codes are decidable. Discrete Mathematics and Theoretical Computer Science\u00a011(2), 1\u201314 (2009)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-15381-5_30","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2010","author":"W. Moczurad","year":"2010","unstructured":"Moczurad, W.: Directed figure codes with weak equality. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds.) IDEAL 2010. LNCS, vol.\u00a06283, pp. 242\u2013250. Springer, Heidelberg (2010)"},{"key":"28_CR9","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology (1998)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T22:46:31Z","timestamp":1553726791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}