Derivation languages of splicing P systems

Labelled splicing P systems are distributed parallel computing models, where sets of strings that evolve by splicing rules are labelled. In this work, we consider labelled splicing systems with the following modifications: (i) The strings in the membranes are present in arbitrary number of copies; (ii) the rules in the regions are finite in number. Results on the language family generated by the labelled splicing system in comparison with the language families of the Chomsky hierarchy, including recursively enumerable languages, are obtained, by involving only either one or two membranes in the P systems considered.