Browsing by Author "Verlan, Sergey"
A Formal Framework for P Systems with Dynamic Structure [Presentation]Freund, Rudolf; Pérez Hurtado de Mendoza, Ignacio; Riscos Núñez, Agustín; Verlan, Sergey (Fénix Editora, 2012)
This article introduces a formalism/framework able to describe different variants of P systems having a dynamic structure. This framework can be useful for the definition of new variants of P systems with dynamic structure, ...
Freund, Rudolf; Pérez Hurtado de Mendoza, Ignacio; Riscos Núñez, Agustín; Verlan, Sergey (Taylor and Francis, 2013)
This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition ...
A Note on the Probabilistic Evolution for P Systems [Presentation]Verlan, Sergey (Fénix Editora, 2012)
In this note we propose a method that permits to describe in a uniform man- ner variants of probabilistic/stochastic P systems. We give examples of such a description for existing models of P systems using probabilities.
Computational Completeness of P Systems Using Maximal Variants of the Set Derivation Mode [Presentation]Alhazov, Artiom; Freund, Rudolf; Verlan, Sergey (Fénix, 2016)
We consider P systems only allowing rules to be used in at most one copy in each derivation step, especially the variant of the maximally parallel derivation mode where each rule may only be used at most once. Moreover, ...
Extended Spiking Neural P Systems with White Hole Rules [Presentation]Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu; Oswald, Marion; Verlan, Sergey (Fénix Editora, 2015)
We consider extended spiking neural P systems with the additional possibility of so-called \white hole rules", which send the complete contents of a neuron to other neurons, and we show how this extension of the original ...
Quirós Carmona, Juan; Verlan, Sergey; Viejo Cortés, Julián; Millán Calderón, Alejandro; Bellido Díaz, Manuel Jesús (2016)
In this article we present a simulator of non-deterministic static P systems using Field Programmable Gate Array (FPGA) technology. Its major feature is a high performance, achieving a constant processing time for each ...
Input-Driven Tissue P Automata [Presentation]Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu; Oswald, Marion; Verlan, Sergey (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
We introduce several variants of input-driven tissue P automata where the rules to be applied only depend on the input symbol. Both strings and multisets are considered as input objects; the strings are either read from ...
Networks of Cells and Petri Nets [Presentation]Bernardini, Francesco; Gheorgue, Marian; Margenstern, Maurice; Verlan, Sergey (Fénix Editora, 2007)
We introduce a new class of P systems, called networks of cells, with rules allowing several cells to simultaneously interact with each other in order to produce some new objects inside some other output cells. We define ...
On P Systems with Bounded Parallelism [Presentation]Bernardini, Francesco; Romero Campero, Francisco José; Gheorghe, Marian; Pérez Jiménez, Mario de Jesús; Margenstern, Maurice; Verlan, Sergey; Krasnogor, Natalio (IEEE Computer Society, 2005)
A framework that describes the evolution of P systems with bounded parallelism is de ned by introducing basic formal features that can be then integrated into a structural operational semantics. This approach investigates ...
P Systems with Minimal Insertion and Deletion [Presentation]Alhazov, Artiom; Krassovitskiy, Alexander; Rogozhin, Yurii; Verlan, Sergey (Fénix Editora, 2009)
In this paper we consider insertion-deletion P systems with priority of deletion over the insertion.We show that such systems with one symbol context-free insertion and deletion rules are able to generate PsRE. If one-symbol ...
P Systems with Minimal Left and Right Insertion and Deletion [Presentation]Freund, Rudolf; Rogozhin, Yurii; Verlan, Sergey (Fénix Editora, 2012)
In this article we investigate the operations of insertion and deletion performed at the ends of a string. We show that using these operations in a P systems framework (which corresponds to using specific variants of ...
Partial Versus Total Halting in P Systems [Presentation]Alhazov, Artiom; Freund, Rudolf; Oswald, Marion; Verlan, Sergey (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 ...
Small Computationally Complete Symport/Antiport P Systems [Presentation]Csuhaj Varjú, Erzsébet; Margenstern, Maurice; Vaszil, György; Verlan, Sergey (Fénix Editora, 2006)
It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally ...