首页> 外文学位 >Unconventional models of computation: DNA and membrane computing.
【24h】

Unconventional models of computation: DNA and membrane computing.

机译:非常规计算模型:DNA和膜计算。

获取原文
获取原文并翻译 | 示例

摘要

The thesis investigates two areas of natural computing inspired from the biology of the living cell: DNA computing and membrane computing.; The main topic addressed in the first area mentioned above, DNA computing, is the power of splicing systems (currently called H systems) using splicing rules of a reduced complexity---with the complexity considered in the sense of the length of the sites where the cut-and-paste operations takes part. In this respect, the notion of the diameter of a splicing rule is introduced, and systematically investigated for several classes of H systems known to be computationally universal (able to generate all recursively enumerable languages): H systems with permitting or forbidding contexts, with target languages, with double splicing, working with multisets, distributed (with two cases: so called test tube systems, and time-varying H systems). Also pertaining to DNA computing is the study of some descriptional complexity measures (number of states, of transitions, etc.) defined for the so called Watson-Crick automata.; The second part of the thesis is devoted to membrane systems, both working with symbol-objects and with string-objects. Systems of the first type are the so-called symport/antiport P systems (used either in the standard mode, for generating a set of numbers, or in a new mode, which leads to a string associated with a computation: following the traces of certain objects through the membrane structure), the communicating P systems, the systems with active membrane (these systems are able to solve NP-complete problems in a polynomial time by making use of an exponential working space obtained by membrane division), and the tissue P systems. In what concerns the P systems with string-objects, we investigate both the case of rewriting rules (namely, used in the partially parallel manner) and the case of splicing rules---thus bridging the two main parts of the thesis.; Besides introducing several new notions (e.g., the diameter of an H system and new classes of P systems), investigating their properties, and improving a series of results from the literature, this thesis also formulates a series of open problems and re search topics. One also gives information about developments in DNA and membrane computing which have followed some of the investigations reported here.
机译:本文研究了受活细胞生物学启发的自然计算的两个领域:DNA计算和膜计算。上面提到的第一个领域中涉及的主要主题是DNA计算,即使用降低了复杂度的剪接规则的剪接系统(当前称为H系统)的功能-从站点长度的角度考虑复杂性剪切和粘贴操作参与其中。在这方面,引入了拼接规则的直径的概念,并系统地研究了已知在计算上通用的几类H系统(能够生成所有递归可枚举的语言):具有允许或禁止上下文且目标明确的H系统双重拼接的多语言语言,可以处理多集合,分布式(有两种情况:所谓的试管系统和时变H系统)。与DNA计算有关的还包括为所谓的Watson-Crick自动机定义的一些描述性复杂性度量(状态数,转换等)的研究。论文的第二部分致力于膜系统,既可以处理符号对象,也可以处理字符串对象。第一类系统是所谓的符号导入/反导入P系统(在标准模式下用于生成一组数字,或在新模式下使用,这会导致与计算相关联的字符串):通过膜结构的某些对象),连通的P系统,具有活动膜的系统(这些系统能够利用通过膜划分获得的指数工作空间在多项式时间内解决NP完全问题)和组织P系统。在涉及带有字符串对象的P系统时,我们研究了重写规则的情况(即,以部分并行的方式使用)和拼接规则的情况,从而将论文的两个主要部分衔接在一起。除了介绍几个新概念(例如H系统的直径和P系统的新类),研究它们的性质并改进文献中的一系列结果外,本文还提出了一系列未解决的问题和研究主题。一个人还提供了有关DNA和膜计算发展的信息,这些信息跟随了此处报道的一些研究。

著录项

  • 作者

    Paun, Paul-Andrei.;

  • 作者单位

    The University of Western Ontario (Canada).;

  • 授予单位 The University of Western Ontario (Canada).;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2003
  • 页码 239 p.
  • 总页数 239
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号