Buscar
Mostrando ítems 11-19 de 19
Artículo
Efficient simulation of tissue-like P systems by transition cell-like P systems
(Springer, 2009)
In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create ...
Artículo
Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems
(World Scientific, 2008)
Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research ...
Artículo
A software tool for verification of Spiking Neural P Systems
(Springer, 2008)
The formal verification of a Spiking Neural P System (SN P Systems, for short) designed for solving a given problem is usually a hard task. Basically, the verification process consists of the search of invariant formulae ...
Artículo
Computational Efficiency of Cellular Division in Tissue-like Membrane Systems
(Romanian Academy, 2008)
Tissue-like P systems with cell division are computing models in the framework of membrane computing. They are inspired by the intercellular communication and neuronal synaptics, their structures being formalized ...
Artículo
A Note on Σ₁-Maximal Models
(Association for Symbolic Logic, 2007)
Let T be a recursive theory in the language of first order Arithmetic. We prove that if T extends: (a) the scheme of parameter free Δ₁-minimization (plus exp), or (b) the scheme of parameter free Π₁-induction, then there ...
Artículo
Efficient computation in rational-valued P systems
(Cambridge University Press, 2009)
In this paper, we describe a new representation for deterministic rational-valued P systems that allows us to form a bridge between membrane computing and linear algebra. On the one hand, we prove that an efficient ...
Artículo
Handling Languages with Spiking Neural P Systems with Extended Rules
(Romanian Academy, Section for Information Science and Technology, 2006)
We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. A tool-kit for computing (some) operations with languages generated by such systems is provided. ...
Artículo
P Systems Computing the Period of Irreducible Markov Chains
(Agora University of Oradea, 2009)
It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the se- quence of distributions at time n converges to the stationary ...
Artículo
Spiking neural P systems with extended rules: universality and languages
(Springer, 2008)
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous ...