Difference between revisions of "Tile Assembly System (TAS)"
Jump to navigation
Jump to search
(→Overview) |
(→Abstract Tile Assembly Model Tile Assembly System (aTAM TAS)) |
||
| Line 7: | Line 7: | ||
==Abstract Tile Assembly Model Tile Assembly System (aTAM TAS)== | ==Abstract Tile Assembly Model Tile Assembly System (aTAM TAS)== | ||
| − | A tile assembly system (TAS) of the [[Abstract Tile Assembly Model | abstract tile assembly model]] is an ordered triple $\mathcal{T} = (T, \sigma, \tau)$, where $T$ is a finite set of tile types, $\sigma$ is a seed assembly with finite domain, and $\tau \in \N$. | + | A tile assembly system (TAS) of the [[Abstract Tile Assembly Model | abstract tile assembly model]] is an ordered triple $\mathcal{T} = (T, \sigma, \tau)$, where $T$ is a finite set of tile types, $\sigma$ is a seed assembly with finite domain, and $\tau \in \mathbb{N}$. |
Revision as of 15:36, 21 May 2013
Overview
Informally, a tile assembly system can be thought of as an instance of a tile assembly model. Unless otherwise denoted, a tile assembly system refers to a tile assembly system of the abstract tile assembly model.
Abstract Tile Assembly Model Tile Assembly System (aTAM TAS)
A tile assembly system (TAS) of the abstract tile assembly model is an ordered triple \(\mathcal{T} = (T, \sigma, \tau)\), where \(T\) is a finite set of tile types, \(\sigma\) is a seed assembly with finite domain, and \(\tau \in \mathbb{N}\).
