Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Combinatorial optimization problems in self-assembly
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Theory and experiments in algorithmic self-assembly
Theory and experiments in algorithmic self-assembly
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Randomized Self-assembly for Approximate Shapes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Complexity of self-assembled shapes
DNA'04 Proceedings of the 10th international conference on DNA computing
Abstract geometrical computation: turing-computing ability and undecidability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Cognitive aspects of programming in pictures
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Generalized gandy-păun-rozenberg machines for tile systems and cellular automata
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Intelligent aspects of AIDA programming
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Theory of algorithmic self-assembly
Communications of the ACM
| Hi-index | 5.24 |
We present a novel way to design self-assembling systems using a notion of signal (or ray) akin to what is used in analyzing the behaviour of cellular automata. This allows purely geometrical constructions, with a smaller specification and easier analysis. We show how to design a system of signals for a given set of shapes, and how to transform these signals into a set of tiles which self-assemble into the desired shapes. We show how to use this technique on two examples: squares (with optimal assembly time and a small number of tiles) and general polygons with arbitrarily good resolution.