{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:45:28Z","timestamp":1648989928188},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p> Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate the computational power of SA-hypergraph automata and show that for every recognizable picture language, there exists an SA-hypergraph automaton that accepts this language. Conversely, we prove that for any restricted SA-hypergraph automaton, there exists a Wang Tile System, a model for recognizable picture languages, that accepts the same language. The advantage of SA-hypergraph automata over Wang automata, acceptors for the class of recognizable picture languages, is that they do not rely on an a priori defined scanning strategy. <\/jats:p>","DOI":"10.1142\/s0129054114400048","type":"journal-article","created":{"date-parts":[[2014,8,8]],"date-time":"2014-08-08T00:18:49Z","timestamp":1407457129000},"page":"419-439","source":"Crossref","is-referenced-by-count":0,"title":["HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY"],"prefix":"10.1142","volume":"25","author":[{"given":"LILA","family":"KARI","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Western Ontario, London, Ontario, N6A 5B7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"STEFFEN","family":"KOPECKI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Western Ontario, London, Ontario, N6A 5B7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AMIRHOSSEIN","family":"SIMJOUR","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Western Ontario, London, Ontario, N6A 5B7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,8,7]]},"reference":[{"key":"p_1","first-page":"290","author":"Anselmo M.","year":"2007","journal-title":"CIAA"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.041"},{"issue":"4","key":"p_7","first-page":"269","volume":"2","author":"L","year":"1997","journal-title":"Languages and Combinatorics"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(77)90023-8"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-01928-4_8"},{"issue":"1","key":"p_16","first-page":"163","volume":"45","author":"Lonati V.","year":"2011","journal-title":"Inf. and Applic."},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917973"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054114400048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T10:48:39Z","timestamp":1565174919000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054114400048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2014,8,7]]},"published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1142\/S0129054114400048"],"URL":"https:\/\/doi.org\/10.1142\/s0129054114400048","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]}}}