Buscar
Mostrando ítems 11-20 de 21
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
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
Preface Special Issue: Advances in Membrane Computing
(Springer, 2016)
Artículo
Spiking Neural P systems with weights
(MIT Press, 2010)
A variant of spiking neural P systems with positive or negative weights on synapses is introduced, where the rules of a neuron fire when the potential of that neuron equals a given value. The involved values—weights, firing ...
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
Membrane computing: Brief introduction, recent results and applications
(Elsevier, 2006)
The internal organization and functioning of living cells, as well as their cooperation in tissues and higher order structures, can be a rich source of inspiration for computer science, not fully exploited at the present ...
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
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 ...