P systems with symport-antiport

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

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.

متن کامل

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...

متن کامل

Reversible P Systems with Symport/Antiport Rules

A deterministic computing system is reversible if every configuration of the system has just one previous configuration or it is an initial configuration. In this paper it is proved that for every reversible register machine there exists a reversible P system with symport/antiport rules such that the P system accepts the same set of integers as the register machine accepts. The result shows tha...

متن کامل

P Systems with Symport/Antiport of Rules

Moving “instructions” instead of “data” using transport mechanisms inspired by biology is the basic idea of the computing device presented in this paper. Specifically, we propose a new class of P systems that use both evolution rules and symport/antiport rules. The idea of this kind of systems is the following: during a computation, symbol-objects (the “data”) evolve using evolution rules, but ...

متن کامل

Small Computationally Complete Symport/Antiport P Systems

It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally complete subclasses of symport/antiport P systems with a number of rules limited by a constant. However, there was no estimation of this number in the literature. In this article, w...

متن کامل

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


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

ژورنال

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

سال: 2011

ISSN: 1941-6016

DOI: 10.4249/scholarpedia.11704