文章基本信息

标题：Rewriting Tissue P Systems
本地全文：下载
作者：M. Mutyam ; V. Jaya Prakash ; K. Krithivasan 等
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：2004
卷号：10
期号：9
DOI：10.3217/jucs-010-09-1250
出版社：Graz University of Technology and Know-Center
摘要：By considering string-objects and rewriting rules, we propose a variant of tissue P systems, namely, rewriting tissue P systems . We show the computational efficiency of rewriting tissue P systems by solving the Satisfiability and the Hamiltonian path problems in linear time. We study the computational capacity of rewriting tissue P systems and show that rewriting tissue P systems with at most two cells and four states are computationally universal. We also show the universality result of rewriting tissue P systems with at most one cell and five states. Finally we propose some new directions for future work.
关键词：Tissue P systems, computational universality, matrix grammars, rewriting tissue P systems