Active Self-Assembly of Simple Units Using an Insertion Primitive

Abstract

While computer science has given us a framework for determining the complexity and difficulty of solving computational problems, we do not yet have a theoretical framework for knowing what actions, behaviors, and life-like qualities can emerge from a given set of simple modular units. There has been much interest in developing models for programming active self-assembly processes in both the reconfigurable robotics community and the
\nnanotechnology community. With respect to materials science
\nand nanotechnology, the models proposed to date are either not yet implementable with our current understanding of synthetic chemistry or those that are implementable are limited to a set of features that do not capture the power of active components. Prior implementable models of molecular assembly only considered the passive behaviors of attaching and detaching from a complex.
\n
\nInspired by the algorithmic tile assembly model [Winfree,
\n1996] and the graph grammar assembly model [Klavins et al.,
\n2004], we describe a formal model for studying the complexity of self-assembled structures with active molecular components. In particular, we add an insertion primitive and we show a direct mapping of our model to a molecular implementation using DNA. We show that the expressive power of this language is stronger than regular languages, but at most as strong as context free grammars. Here, we explore the trade-off between the
\ncomplexity of the system (in terms of the number of unit types), and the behavior of the system and speed of its assembly. We find that we can grow a line of any given length n in expected time O(log^3 n) using O(log^2 n)
\nmonomers. If we grow a line with k insertion rules, either the expected final length is infinite or the expected length at time t is at most (2t+2)^k^2, which is
\npolynomial in t.