Simulating Counter Automata by P Systems with Symport/Antiport

  • Pierluigi Frisco
  • Hendrik Jan Hoogeboom
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Pierluigi Frisco
    • 1
  • Hendrik Jan Hoogeboom
    • 1
  1. 1.Institute for Advanced Computer ScienceUniversiteit LeidenThe Netherlands

Personalised recommendations