Synchronization of rules in membrane computing

被引：23

作者：

Aman, Bogdan ^{[1
]}

Ciobanu, Gabriel ^{[2
]}

机构：

[1] Alexandru Ioan Cuza Univ, Iasi, Romania

[2] Romanian Acad, Inst Comp Sci, Iasi, Romania

来源：

JOURNAL OF MEMBRANE COMPUTING | 2019年 / 1卷 / 04期

关键词：

Membrane computing; Synchronization of the rules; Computational completeness; Arithmetic operations; P-SYSTEMS; COMPLETENESS;

D O I：

10.1007/s41965-019-00022-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We modify the most used evolution strategy in membrane systems (namely that of maximal parallelism) by imposing a synchronization between rules. A synchronization over a set of rules can be applied only if each rule of the set can be applied at least once. For membrane systems working in the accepting mode, this synchronization is powerful enough to provide the computational completeness without any other ingredient (no catalysts, promoters, inhibitors, etc). The modeling power of synchronization is described by simulating the basic arithmetic operations (addition, subtraction, multiplication and division).

引用

页码：233 / 240

页数：8

共 27 条

[1]

Agrigoroaiei O, 2010, LECT NOTES COMPUT SC, V6501, P53, DOI 10.1007/978-3-642-18123-8_7

[2]

Alhazov A, 2009, LECT NOTES COMPUT SC, V5391, P118

[3]

Aman Bogdan, 2019, Membrane Computing. 19th International Conference, CMC 2018. Revised Selected Papers. Lecture Notes in Computer Science (LNCS 11399), P57, DOI 10.1007/978-3-030-12797-8_5

[4] Efficiently solving the Bin Packing problem through bio-inspired mobility [J].