Name
Abstract | ||
|---|---|---|
In the present paper, we propose P systems that work in a constant number of steps. We first propose two P systems for computing multiple input logic functions. An input of the logic functions is a set of n binary numbers of m bits, and an output is a binary number defined by the logic functions. The first and second P systems compute AND and EX-OR functions for the input, and both of the P systems work in a constant number of steps using O(mn) types of objects, a constant number of membranes, and evolution rules of size O(mn). Next, we propose the P system for the addition of two binary numbers of m bits. The P system works in a constant number of steps using O(m) types of objects, a constant number of membranes and evolution rules of size O(m2). We also introduce a P system that computes the addition of two vectors of size n using the above P system as a sub-system. The P system for vector addition works in a constant number of steps using O(mn) types of objects, a constant number of membranes, and evolution rules of size O(m2n). |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/IPDPS.2009.5160884 | IPDPS |
Keywords | Field | DocType |
logic function,membrane computing,size o,p system work,n binary number,constant number,m bit,binary number,p system,size n,evolution rule,biological systems,computational modeling,computer science,arithmetic,parallel processing,data mining,probability density function,binary numbers,skin,computational complexity | Evolution biology,Computer science,Algorithm,Membrane,Membrane computing,Probability density function,Binary number,Computational complexity theory,Computation,P system | Conference |
ISSN | Citations | PageRank |
1530-2075 | 0 | 0.34 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Fujiwara | 1 | 122 | 27.25 |
| Takeshi Tateishi | 2 | 8 | 1.33 |