Triangular and hexagonal tile self-assembly systems

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We discuss theoretical aspects of the self-assembly of triangular tiles, in particular, right triangular tiles and equilateral triangular tiles, and the self-assembly of hexagonal tiles. We show that triangular tile assembly systems and square tile assembly systems cannot be simulated by each other in a non-trivial way. More precisely, there exists a deterministic square (hexagonal) tile assembly system S such that no deterministic triangular tile assembly system that is a division of S produces an equivalent supertile (of the same shape and same border glues). There also exists a deterministic triangular tile assembly system T such that no deterministic square (hexagonal) tile assembly system produces the same final supertile while preserving border glues. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Kari, L., Seki, S., & Xu, Z. (2012). Triangular and hexagonal tile self-assembly systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7160 LNCS, pp. 357–375). https://doi.org/10.1007/978-3-642-27654-5_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free