arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.07908cs.CCcs.FL
收藏

非合作自组装的泵浦引理

A pumping lemma for non-cooperative self-assembly

Pierre-Étienne Meunier, Damien Regnault

摘要:

我们证明了一个结果,这强烈暗示了计算的弱点,到目前为止,抵制了许多尝试的正式分析或积极的建设的瓷砖组装模型。具体地说,我们证明了,在Winfree的抽象瓦片组装模型中,当限制为只使用非合作绑定时,任何从种子开始的、可以在所有终端组装中生长的足够长的路径都是可泵的,这意味着该路径可以扩展成无限的、最终周期性的路径。这一结果可以看作是有限状态自动机的泵引理的几何推广,并且解决了在这个模型中可以确定性地计算什么的问题。此外,这个问题激发了一种称为可见胶的新方法的发展。我们相信,这种方法也可以用来解决其他长期存在的问题,在计算几何,例如与自避免路径。瓦片组装(包括非合作瓦片组装)最初是由Winfree和Rothemund在STOC 2000中引入的,以了解如何对形状进行编程。非协作变体,也称为温度1瓦片组装,是允许瓦片一旦在一侧匹配就绑定的模型,而在协作瓦片组装中,一些瓦片需要在多个侧上匹配才能绑定。之前,只有一个已知的结果(SODA 2014)显示了对一般非合作自组装可以实现的组件的限制,而对其计算表现力没有任何影响。对于非正方形瓷砖(如polyominos,SODA 2015),最近的其他工作表明,该模型在计算上很快变得强大。

英文摘要:

We prove a result which strongly hints at the computational weakness of a model of tile assembly that has so far resisted many attempts of formal analysis or positive constructions. Specifically, we prove that, in Winfree's abstract Tile Assembly Model, when restricted to use only noncooperative bindings, any long enough path starting from the seed that can grow in all terminal assemblies is pumpable, meaning that this path can be extended into an infinite, ultimately periodic path. This result can be seen as a geometric generalization of the pumping lemma of finite state automata, and closes the question of what can be computed deterministically in this model. Moreover, this question has motivated the development of a new method called visible glues. We believe that this method can also be used to tackle other long-standing problems in computational geometry, in relation for instance with self-avoiding paths. Tile assembly (including non-cooperative tile assembly) was originally introduced by Winfree and Rothemund in STOC 2000 to understand how to program shapes. The non-cooperative variant, also known as temperature 1 tile assembly, is the model where tiles are allowed to bind as soon as they match on one side, whereas in cooperative tile assembly, some tiles need to match on several sides in order to bind. Previously, exactly one known result (SODA 2014) showed a restriction on the assemblies general non-cooperative self-assembly could achieve, without any implication on its computational expressiveness. With non-square tiles (like polyominos, SODA 2015), other recent works have shown that the model quickly becomes computationally powerful.

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

↑