In the 2010, matrix representation of SN P system without delay was presented while in the case of SN P systems with delay, matrix representation was suggested in the 2017. These representations brought about series of simulation of SN P systems using computer software and hardware technology. In this work, we revisit these representation and provide some observations on the behavior of the computations of SN P systems. The concept of reachability of configuration is considered in both SN P systems with and without delays. A better computation of next configuration is proposed in the case of SN P system with delay.
翻译:2010年,无拖延地提出了无拖延地提供SNP系统的矩阵表,而对于无拖延地提供SNP系统的矩阵表则在2017年提出了 " 矩阵表 " 建议,这些表述导致利用计算机软件和硬件技术对SNP系统进行一系列模拟;在这项工作中,我们重新审视这些表述,并就SNP系统计算行为提出一些意见;在无拖延和无拖延的情况下,SNP系统中都考虑了配置的可达性概念;在无拖延地提出更好地计算SNP系统的下一个配置。