最大并行多集重写系统的最小化策略
Minimization Strategies for Maximally Parallel Multiset Rewriting Systems
摘要:
最大并行多集重写系统(MPMRS)为非结构化对象之间的关系提供了一种方便的表达方式。各种计算设备的功能可以用MPMRS(例如,寄存器机器和P系统的许多变体)。特别地,这意味着MPMRS在计算上是完整的;然而,直接转换会导致相当大量的规则。与其他类别的计算完整设备一样,找到具有最小规则数量的通用系统是一个挑战。在这篇文章中,我们提出了不同的规则最小化策略MPMRS编码和结构转换的基础上。我们将这些策略应用到一个小型通用寄存器机器(Korec,1996)的翻译中,我们证明了存在一个具有23条规则的通用MPMRS。由于MPMRS是相同的限制性的变种的P系统与反端口的规则,我们得到的结果,改善了以前已知的结果,这些系统的规则的数量。
英文摘要:
Maximally parallel multiset rewriting systems (MPMRS) give a convenient way to express relations between unstructured objects. The functioning of various computational devices may be expressed in terms of MPMRS (e.g., register machines and many variants of P systems). In particular, this means that MPMRS are computationally complete; however, a direct translation leads to quite a big number of rules. Like for other classes of computationally complete devices, there is a challenge to find a universal system having the smallest number of rules. In this article we present different rule minimization strategies for MPMRS based on encodings and structural transformations. We apply these strategies to the translation of a small universal register machine (Korec, 1996) and we show that there exists a universal MPMRS with 23 rules. Since MPMRS are identical to a restricted variant of P systems with antiport rules, the results we obtained improve previously known results on the number of rules for those systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。