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. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kari, L., Kopecki, S., & Simjour, A. (2013). Hypergraph automata: A theoretical model for patterned self-assembly. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7956 LNCS, pp. 125–137). Springer Verlag. https://doi.org/10.1007/978-3-642-39074-6_13
Mendeley helps you to discover research relevant for your work.