{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:15:45Z","timestamp":1729678545630,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181977","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"530-537","source":"Crossref","is-referenced-by-count":15,"title":["On the decidability of self-assembly of infinite ribbons"],"prefix":"10.1109","author":[{"given":"L.","family":"Adleman","sequence":"first","affiliation":[]},{"given":"J.","family":"Kari","sequence":"additional","affiliation":[]},{"given":"L.","family":"Kari","sequence":"additional","affiliation":[]},{"given":"D.","family":"Reishus","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1038\/35035038","article-title":"Logical computation using algorithmic self-assembly of DNA triple-crossover molecules","volume":"407","author":"mao","year":"2000","journal-title":"Nature"},{"key":"17","first-page":"121","article-title":"U?ber eine Schlussweise aus dem Endlichen ins Unendliche","volume":"3","author":"ko?nig","year":"1927","journal-title":"Acta Litt Sci Szeged"},{"key":"18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1038\/35017519","article-title":"Self-directed growth of molecular nano-structures on silicon","volume":"406","author":"lopinski","year":"2000","journal-title":"Nature"},{"key":"33","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1126\/science.1962191","article-title":"Molecular self-assembly and nanochemistry: A chemical strategy for the synthesis of nanostructures","volume":"254","author":"whitesides","year":"1991","journal-title":"Science"},{"key":"15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","article-title":"Reversibility of 2D cellular automata is undecidable","volume":"45","author":"kari","year":"1990","journal-title":"Physica D"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80025-X"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90174-0"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199431"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18170-9_161"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90174-0"},{"key":"21","first-page":"141","article-title":"2D DNA self-assembly for satisfiability","volume":"54","author":"lagoudakis","year":"2000","journal-title":"Series in DIMACS"},{"key":"20","article-title":"Decidability of the tiling connectivity problem","volume":"195","author":"myers","year":"1979","journal-title":"Notices Amer Math Soc"},{"key":"22","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1038\/35091143","article-title":"Self-assembled domain patterns","volume":"412","author":"plass","year":"2001","journal-title":"Nature"},{"key":"23","first-page":"217","article-title":"Local parallel biomolecular computation","volume":"48","author":"reif","year":"1999","journal-title":"Series in DIMACS"},{"key":"24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","article-title":"Undecidability and nonperiodicity for tilings of the plane","volume":"12","author":"robinson","year":"1971","journal-title":"Inven Math"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.97.3.984"},{"article-title":"Theory and experiments in algorithmic self-assembly","year":"2001","author":"rothemund","key":"26"},{"key":"27","first-page":"459","article-title":"The program-size complexity of self-assembled squares","author":"rothemund","year":"0","journal-title":"ACM Symposium on Theory of Computing (STOC) 2001"},{"key":"28","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1038\/35099520","article-title":"Self-assembled monolayer organic field-effect transistors","volume":"413","author":"scho?n","year":"2000","journal-title":"Nature"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2005.846816"},{"article-title":"Towards a mathematical theory of self-assembly","year":"2000","author":"adleman","key":"3"},{"key":"2","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"266","author":"adleman","year":"1994","journal-title":"Science"},{"key":"10","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1126\/science.289.5482.1170","article-title":"Forming electrical networks in three dimensions by self-assembly","volume":"289","author":"gracias","year":"2000","journal-title":"Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/332833.332842"},{"key":"30","first-page":"191","article-title":"Universal computation via self-assembly of DNA: Some theory and experiments","volume":"44","author":"winfree","year":"1998","journal-title":"Series in DIMACS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/0066"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380881"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/MMB.2006.251471"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509913"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1038\/28998"},{"article-title":"Linear self-assemblies: Equilibria, entropy, and convergence rates","year":"2000","author":"adleman","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/7\/3\/004"},{"key":"8","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1038\/35079541","article-title":"Self-assembly of regular hollow icosahedra in salt-free catanionic solutions","volume":"411","author":"dubois","year":"2001","journal-title":"Nature"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","acronym":"SFCS-02","location":"Vancouver, BC, Canada"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181977.pdf?arnumber=1181977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:46:26Z","timestamp":1497552386000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181977\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181977","relation":{},"subject":[]}}