Buscar
Mostrando ítems 1-3 de 3
Ponencia
Partial Versus Total Halting in P Systems
(Fénix Editora, 2007)
We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a ...
Ponencia
P Systems with Active Membranes and Two Polarizations
(Fénix Editora, 2004)
P systems with active membranes using only two electrical charges and only rules of types (a) and (c) assigned to at most two membranes are shown to be computationally complete { thus improving the previous result of ...
Ponencia
P Systems with One Membrane and Symport/Antiport Rules of Five Symbols Are Computationally Complete
(Fénix Editora, 2005)
We consider P systems with only one membrane using symport/antiport rules and prove that any recursively enumerable set of k-dimensional vectors of natural numbers can be generated (accepted) by using at most k + 4 ...