Buscar
Mostrando ítems 1-5 de 5
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
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 ...
Ponencia
Two Universality Results for (Mem)Brane Systems
(Fénix Editora, 2006)
We prove that P systems with mate and drip operations and using at most five membranes during any step of a computation are universal. This improves a recent similar result from, where eleven membranes are used. The proof ...
Ponencia
Particular Results for Variants of P Systems with One Catalyst in One Membrane
(Fénix Editora, 2006)
Purely catalytic P systems can generate all recursively enumerable sets of natural numbers with only three catalysts in one membrane, whereas we know that one catalyst in one membrane is not enough. On the other hand, P ...