Name
Abstract | ||
|---|---|---|
In the present paper, we consider asynchronous P systems, which is a computational model based on cell activity, and propose two P systems that execute a compare-and-exchange operation and sorting. We first propose an asynchronous P system for the compare-and-exchange operation of two binary numbers of m bits. The P system works in O(m) steps by using O(m) types of objects, a constant number of membranes and evolution rules of size O(m). We next propose an asynchronous P system for sorting of n binary numbers of m bits by using the above asynchronous P system as a sub-system. The P system works in O(mn^2) steps by using O(mn) types of objects, a constant number of membranes, and evolution rules of size O(mn). |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/CANDAR.2015.21 | CANDAR |
Keywords | Field | DocType |
membrane computing,compare and exchange,sorting | Asynchronous communication,Discrete mathematics,Computer science,Algorithm,Sorting,Membrane,Membrane computing,P system,Binary number | Conference |
ISSN | Citations | PageRank |
2379-1888 | 0 | 0.34 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yutaka Nishida | 1 | 0 | 0.34 |
| Akihiro Fujiwara | 2 | 122 | 27.25 |