Buscar
Mostrando ítems 1-6 de 6
Artículo
The Unique Satisfiability Problem from a Membrane Computing Perspective
(Romanian Academy, Section for Information Science and Technology, 2018)
Complexity class DP is the class of “differences” of any two languages in NP. It verifies that NP[ co-NP DP PNP, where PNP is the second level of the polynomial hierarchy, specifically, it is the class of languages ...
Artículo
P systems with symport/antiport rules: When do the surroundings matter?
(Elsevier, 2018-05-01)
Cell-like P systems where communication between the regions are carried out by rules of type symport/antiport are considered. These systems compute by changing the places of objects with respect to the membranes, and not ...
Artículo
A P-Lingua based Simulator for Tissue P Systems with Cell Separation
(Romanian Academy, Section for Information Science and Technology, 2014)
Tissue P systems are one of the currently active research topics within the field of Membrane Computing. In particular, their computational efficiency is being investigated in the case when the number of cells can grow ...
Artículo
A P–Lingua Based Simulator for P Systems with Symport/Antiport Rules
(IOS Press, 2015)
Inspired by mitosis process and membrane fission processes, cell-like P systems with symport/antiport rules and membrane division rules or membrane separation rules have been introduced, respectively. These computation ...
Artículo
When object production tunes the efficiency of membrane systems
(Elsevier, 2020)
Psystems with active membranes is one of the most studied models within the field ofMembrane Computing. Simulating the organization and behavior of the living cells througha tree-like structure and abstracting the mechanisms ...
Artículo
The role of the direction in tissue P systems with cell separation
(Institut für Informatik, Justus-Liebig-Universität Giessen, 2014)
Tissue P systems with cell separation where the communication among cells is performed by means of symport and antiport rules are able to efficiently solve computationally hard problems in a feasible time by a space-time ...