Simulating Counter Automata by P Systems with Symport/Antiport
- Cite this paper as:
- Frisco P., Hoogeboom H.J. (2003) Simulating Counter Automata by P Systems with Symport/Antiport. In: PĂun G., Rozenberg G., Salomaa A., Zandron C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.