Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science
The computational power of cell division in P systems: Beating down parallel computers?
Natural Computing: an international journal
On the power of membrane division in P systems
Theoretical Computer Science - Words, languages and combinatorics
Solving multidimensional 0--1 knapsack problem by P systems with input and active membranes
Journal of Parallel and Distributed Computing
Further remark on P systems with active membranes and two polarizations
Journal of Parallel and Distributed Computing
On small universal antiport P systems
Theoretical Computer Science
Smaller Universal Spiking Neural P Systems
Fundamenta Informaticae
On the efficiency of p systems with active membranes and two polarizations
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Fundamenta Informaticae
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
Fundamenta Informaticae
Hi-index | 5.23 |
P systems are a class of distributed and parallel computation models inspired by the structure and the functioning of living cells. P systems have been used to solve computation hard problems, where the execution of each rule is completed in unit time (a global clock is assumed for timing and synchronizing the execution of rules). The assumption that the execution of each rule takes exactly one time unit plays an vital role to make a system working synchronously, and it has also been used to characterize the computational efficiency and time complexity of a system. In this work, we investigate the computation power of P systems without such time assumption. Specifically, we give a time-free solution to SAT problem using P systems with active membranes in the sense that the correctness of the solution does not depend on the precise timing of the involved rules.