Transformations and Preservation of Self-assembly Dynamics through Homotheties

Authors:
Florent Becker
Affiliations:
Laboratoire d'Informatique du Parallélisme, UMR 5668 CNRS, INRIA, Université Lyon 1, ÉNS Lyon, Lyon Cedex 07, France 69364
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 5
Cited 0

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
Complexity of self-assembled shapes

DNA'04 Proceedings of the 10th international conference on DNA computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new notion in self-assembly, that of transforming the dynamics of assembly. This notion allows us to have transformation of the plane computed within the assembly process. Then we apply this notion to zooming. The possibility of zooming depends on the order condition. This shows that this condition, which arose from engineering concerns (how to design understandable tile systems) is indeed an important condition of regularity for the assembly process.