Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes

نویسندگان

  • Artiom Alhazov
  • Yurii Rogozhin
چکیده

1 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Str. Academiei 5, Chişinău, MD-2028 Moldova {artiom,rogozhin}@math.md 2 Åbo Akademi University Department of Information Technologies Turku Center for Computer Science, FIN-20520 Turku, Finland [email protected] 3 Rovira i Virgili University, Research Group on Mathematical Linguistics, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes

We prove that any set of numbers containing zero generated by symport/antiport P systems with two membranes and minimal cooperation is finite (for both symport/antiport P systems and for purely symport P systems). On the other hand, one additional object in the output membrane allows symport/antiport P systems with two membranes and minimal cooperation generate any recursively enumerable sets o...

متن کامل

Generating Languages by P Systems with Minimal Symport/Antiport

It is known that P systems with two membranes and minimal symport/antiport rules are “almost” computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two membranes and symport rules of weight two or symport/antiport rules of weight one generate all recursi...

متن کامل

About P systems with symport/antiport

It is proved that four membranes suffice to P systems with minimal symport/antiport to generate all recursively enumerable sets of numbers. It is also proved that P systems with symport/antiport without maximal parallelism are equivalent to partially blind counter automata.

متن کامل

On the Universality of P Systems with Minimal Symport/Antiport Rules

P systems with symport/antiport rules of a minimal size (only one object passes in any direction in a communication step) were recently proven to be computationally universal. The proof from [2] uses systems with nine membranes. In this paper we improve this results, by showing that six membranes suffice. The optimality of this result remains open (we believe that the number of membranes can be...

متن کامل

P Systems with Symport/Antiport and Time

We consider symport/antiport P systems using time as the output of a computation. We describe and study the properties of “timed symport/antiport systems”, showing that considering the time as support for reporting the result of computation yields more power/flexibility to these systems. We were able to improve or match the best results concerning the symport/antiport systems which consider the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007