Identifying Shapes Using Self-Assembly (extended abstract)

Details Identifying Shapes Using Self-Assembly (extended abstract) Identifying Shapes Using Self-Assembly (extended abstract)

2010-06-15

arxiv.org/abs/1006.3046v1

Computer Science

Computational Complexity

Scientific paper

In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether or not the given input shape--drawn from a very general class of shapes--matches a particular target shape. We first study the complexity of correctly identifying squares. Then we investigate the complexity associated with the identification of a considerably more general class of non-square, hole-free shapes.

Affiliated with

Also associated with

No associations

Rating

Identifying Shapes Using Self-Assembly (extended abstract) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Identifying Shapes Using Self-Assembly (extended abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Identifying Shapes Using Self-Assembly (extended abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-105455