Buscar
Mostrando ítems 1-10 de 17
Ponencia
Event-Related Outputs of Computations in P Systems
(Fénix Editora, 2005)
We briefly investigate the idea to consider as the result of a computation in a P system the number of steps elapsed between two events produced during the computation. Specifically, we first consider the case when the ...
Ponencia
P Systems with Active Membranes and Without Polarizations
(Fénix Editora, 2004)
P systems with active membranes but without using electrical charges (polarizations) are shown to be complete for generating recursively enumerable string languages when working on string objects and using only rules ...
Ponencia
Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
(Fénix Editora, 2007)
We investigate the computing power and the efficiency of P systems with active membranes without polarizations, working in the minimally parallel mode. We prove that such systems are computationally complete and able to ...
Ponencia
Extended Spiking Neural P systems with Excitatory and Inhibitory Astrocytes
(Fénix Editora, 2007)
We investigate an extended model of spiking neural P systems incorporating astrocytes and their excitatory or inhibitory influence on axons between neurons. Using very restricted variants of extended spiking neural P ...
Ponencia
Multiset Random Context Grammars, Checkers, and Transducers
(Fénix Editora, 2006)
We introduce a general model of random context multiset grammars as well as the concept of multiset random context checkers and transducers. Our main results show how recursively enumerable sets of finite multisets can ...
Ponencia
On String Languages Generated by Spiking Neural P Systems
(Fénix Editora, 2006)
We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated ...
Ponencia
P Systems with Antiport Rules for Evolution Rules
(Fénix Editora, 2004)
We investigate a variant of evolution-communication P systems where the computation is performed in two substeps. First, all possible an- tiport rules are applied in a non-deterministic, maximally parallel way, ...
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
(Tissue) P Systems Using Non-cooperative Rules Without Halting Conditions
(Fénix Editora, 2008)
We consider (tissue) P systems using non-cooperative rules, but considering computations without halting conditions. As results of a computation we take the contents of a specified output membrane/cell in each derivation ...
Ponencia
Small Universal Antiport P Systems and Universal Multiset Grammars
(Fénix Editora, 2006)
Based on the construction of a universal register machine we construct a universal antiport P system working with 31 rules in the maximally parallel mode in one membrane, and a universal antiport P system with forbidden ...