Abstract. We first survey some results concerning the generative power of $\mathrm{P} $ sys-tems with objects described by strings processed by rewriting and by splicing, then we consider $\mathrm{P} $ systems with multisets of string-objects processed by replication, splitting, point mutation, and crossover. A combination of these variants (systems with multisets of string-objects processed by rewriting and crossing-over, without using priorities) is shown to characterize the recursively enumerable languages (moreover, systems with five membranes suffice)..
We consider first an operation with strings and languages suggested by superposed windows on the com...
Languages appeared from the very beginning in membrane computing, by their length sets or directly ...
In this paper, we introduce generating networks of splicing processors (GNSP for short), a...
We consider a uniform way of treating objects and rules in P systems: we start with multisets of rul...
A membrane system (P system) is a model of computation inspired by some basic features of the struct...
We consider here a variant of rewriting P systems [1], where communication is controlled by the cont...
The aim of this paper is to bring together two new and powerful tools: on the one hand, the splicing...
This paper presents new models for all recursive enumerable languages. These models are based on mul...
AbstractFirst, we recall some characterizations of recursively enumerable languages by means of fini...
AbstractIn this paper we discuss how any recursively enumerable language can be generated using a di...
Languages appeared from the very beginning in membrane computing, by their length sets or directly a...
AbstractComputing by splicing is a new powerful tool stemming originally from molecular genetics. Th...
AbstractWe continue the analysis of P systems with gemmation of mobile membranes. We solve an open p...
AbstractParallel communicating grammar systems (PC grammar systems, in short) are language generatin...
We investigate genPCol automata with input mappings that can be realized through the application of ...
We consider first an operation with strings and languages suggested by superposed windows on the com...
Languages appeared from the very beginning in membrane computing, by their length sets or directly ...
In this paper, we introduce generating networks of splicing processors (GNSP for short), a...
We consider a uniform way of treating objects and rules in P systems: we start with multisets of rul...
A membrane system (P system) is a model of computation inspired by some basic features of the struct...
We consider here a variant of rewriting P systems [1], where communication is controlled by the cont...
The aim of this paper is to bring together two new and powerful tools: on the one hand, the splicing...
This paper presents new models for all recursive enumerable languages. These models are based on mul...
AbstractFirst, we recall some characterizations of recursively enumerable languages by means of fini...
AbstractIn this paper we discuss how any recursively enumerable language can be generated using a di...
Languages appeared from the very beginning in membrane computing, by their length sets or directly a...
AbstractComputing by splicing is a new powerful tool stemming originally from molecular genetics. Th...
AbstractWe continue the analysis of P systems with gemmation of mobile membranes. We solve an open p...
AbstractParallel communicating grammar systems (PC grammar systems, in short) are language generatin...
We investigate genPCol automata with input mappings that can be realized through the application of ...
We consider first an operation with strings and languages suggested by superposed windows on the com...
Languages appeared from the very beginning in membrane computing, by their length sets or directly ...
In this paper, we introduce generating networks of splicing processors (GNSP for short), a...