Difference between revisions of "Weak Self-Assembly"

From self-assembly wiki
Jump to navigation Jump to search
 
Line 13: Line 13:
  
 
[[Category: Terminology]]
 
[[Category: Terminology]]
 +
[[Category:Self-assembly]]

Latest revision as of 15:22, 27 May 2014

Essentially, weak self-assembly can be thought of as the creation (or "painting") of a pattern of tiles that are a subset of the tile set(usually taken to be a unique "color") on a possibly larger ``canvas of un-colored tiles.

Definition

A set \(X \in \mathbb{Z}^2\) weakly self-assembles if there exists a TAS \({\mathcal T} = (T, \sigma, \tau)\) and a set \(B \subseteq T\) such that \(\alpha^{-1}(B) = X\) holds for every terminal assembly \(\alpha \in \termasm{T}\).

See also

Strict Self-Assembly