Formal languages
Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
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
Complexity classes in models of cellular computing with membranes
Natural Computing: an international journal
Further remarks on P systems with active membranes, separation, merging, and release rules
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Inhibiting/de-inhibiting rules in p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Hi-index | 0.00 |
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes using inhibiting/de-inhibiting rules. This new approach on the simulation of Boolean gates has the advantage of a self-embedded synchronization, an extra system to solve this problem not being needed. Moreover, the number of membranes and objects we use for the simulation of Boolean gates is only two. NP-complete problems, particularly CIRCUIT-SAT, are also considered here. In addition, we simulate a ‘DNA-like’ way of (experimentally) solving SAT problem using the tools given by polarization, merging, and separation in P systems.