Simulating Counter Automata by P Systems with Symport/Antiport

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The complexity, expressed in number of membranes and weight of rules, of Psystems with symport/antiport generating recursively enumerable sets is reduced if counter automata instead of matrix grammars are simulated. We consider both subsets of N obtained by counting objects in a designated membrane, and string languages obtained by following the traces of a designated object.