首页> 外文会议>International Conference on Dna Computing And Molecular Programming >A Minimal Requirement for Self-assembly of Lines in Polylogarithmic Time
【24h】

A Minimal Requirement for Self-assembly of Lines in Polylogarithmic Time

机译:多对数时间对线的自组装的最低要求

获取原文

摘要

Self-assembly is the process in which small and simple components assemble into large and complex structures without explicit external control. The nubot model generalizes previous self-assembly models (e.g. aTAM) to include active components which can actively move and undergo state changes. One main difference between the nubot model and previous self-assembly models is its ability to perform exponential growth. In the paper, we study the problem of finding a minimal set of features in the nubot model which allows exponential growth to happen. We only focus on nubot systems which assemble a long line of nubots with a small number of supplementary layers. We prove that exponential growth is not possible with the limit of one supplementary layer and one state-change per nubot. On the other hand, if two supplementary layers are allowed, or the disappearance rule can be performed without a state change, then we can construct nubot systems which grow exponentially.
机译:自组装是一个过程,其中小的和简单的组件可以组装成大型的复杂结构,而无需明确的外部控制。 nubot模型概括了以前的自组装模型(例如aTAM),以包含可以主动移动并进行状态更改的主动组件。 nubot模型与以前的自组装模型之间的主要区别在于其执行指数增长的能力。在本文中,我们研究了在nubot模型中找到最小特征集以允许发生指数增长的问题。我们只关注nubot系统,这些系统组装了很长数量的nubot和少量的辅助层。我们证明了在每个核机器人只有一个补充层和一个状态改变的限制下不可能实现指数增长。另一方面,如果允许两个补充层,或者可以在不改变状态的情况下执行消失规则,那么我们可以构建成指数增长的核机器人系统。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号