Buscar
Mostrando ítems 1-9 de 9
Artículo
Tissue P systems with channel states
(Elsevier, 2005)
We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for ...
Artículo
P automata revisited
(Elsevier, 2012)
We continue here the investigation of P automata, in their non-extended case, a class of devices which characterize non-universal family of languages. First, a recent conjecture is confirmed: any recursively enumerable ...
Artículo
P systems with minimal parallelism
(Elsevier, 2007)
A current research topic in membrane computing is to find more realistic P systems from a biological point of view, and one target in this respect is to relax the condition of using the rules in a maximally parallel way. ...
Artículo
Spiking Neural P systems with several types of spikes
(Agora University of Oradea, 2011)
With a motivation related to gene expression, where enzymes act in series, somewhat similar to the train spikes traveling along the axons of neurons, we consider an extension of spiking neural P systems, where several ...
Artículo
Tissue P Systems With Channel States Working in the Flat Maximally Parallel Way
(IEEE Computer Society, 2016)
issue P systems with channel states are a class of bio-inspired parallel computational models, where rules are used in a sequential manner (on each channel, at most one rule can be used at each step). In this work, tissue ...
Artículo
Recent Computability Models Inspired from Biology: DNA and Membrane Computing
(Universidad del País Vasco, 2003)
We briefly present two areas of natural computing, vividly investigated in the recent years: DNA computing and membrane computing. Both of them have the roots in cellular biology and are rather developed at the theoretical ...
Artículo
Uniform solutions to SAT and Subset Sum by spiking neural P systems
(Springer, 2009)
We continue the investigations concerning the possibility of using spiking neural P systems as a framework for solving computationally hard problems, addressing two problems which were already recently considered in this ...
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 ...
Artículo
An infinite hierarchy of languages defined by dP systems
(Elsevier, 2012)
Here, we continue the study of the recently introduced dP automata. They are symport/antiport P systems consisting of a number of components, each one accepting a string, and working together in recognizing the concatenation ...