Tilings and patterns
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Theory and experiments in algorithmic self-assembly
Theory and experiments in algorithmic self-assembly
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
SIAM Journal on Computing
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
Journal of Computer and System Sciences
Polyominoes simulating arbitrary-neighborhood zippers and tilings
Theoretical Computer Science
Hi-index | 0.00 |
Self-assembly is the process by which objects aggregate independently and form complex structures. One of the theoretical frameworks in which the process of self-assembly can be embedded and formally studied is that of tile systems. A Wang tile is a square unit, with glues on its edges, attaching to other tiles which have matching glues, and forming larger and larger structures. In this paper we concentrate over two basic, but essential, self-assembling structures done by Wang tiles. The first one, called ribbon, is a non-self-crossing wire-like structure, in which successive tiles are adjacent along an edge, and where tiles are glued to their predecessor and successor by use of matching glues. The second one, called zipper, is a similar contiguous structure, only that here, all touching tiles must have matching glues on their abutting edges, independently of their position in the structure. In case of Wang tiles, it has been shown that these two structures are equivalent. Here we generalize this result for the case when the tiles have eight glues, four on their edges and four on their corners. Thus we show that an eight neighborhood dependency, namely the Moore neighborhood, can be simulated by a quasi-linear dependency.