arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.3046cs.CCcs.DS
收藏

使用自组装识别模板(扩展抽象)

Identifying Shapes Using Self-Assembly (extended abstract)

Matthew J. Patitz, Scott M. Summers

摘要:

在本文中,我们介绍了算法自组装理论中的以下问题:给定一个输入形状作为基于瓦片的自组装系统的种子,设计一个有限的瓦片集,在某种意义上,它可以唯一地识别给定的输入形状-从一个非常一般的形状类中提取-与特定的目标形状匹配。我们首先研究正确识别正方形的复杂性。然后,我们调查的复杂性与识别的一个相当一般的类的非方形,无孔的形状。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑