RO EN
Generating Languages by P Systems with Minimal Symport/Antiport
Authors: Alhazov Artiom, Rogojin Iurie
– 0.22 Mb
Abstract
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 recursively enumerable languages.Artiom Alhazov, Yurii Rogozhin,
Institute of Mathematics and Computer Science,
Academy of Sciences of Moldova
5 Academiei str., Chisinau
MD-2028, Moldova
E-mail:
Research Group on Mathematical Linguistics
Rovira i Virgili University, Tarragona, Spain
E-mail:
Dr.hab. Yurii Rogozhin
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chisinau,
MD-2028, Moldova
E-mail:
Institute of Mathematics and Computer Science,
Academy of Sciences of Moldova
5 Academiei str., Chisinau
MD-2028, Moldova
E-mail:
Research Group on Mathematical Linguistics
Rovira i Virgili University, Tarragona, Spain
E-mail:
Dr.hab. Yurii Rogozhin
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chisinau,
MD-2028, Moldova
E-mail:
Fulltext
– 0.22 Mb
Contents
- Generating Languages by P Systems with Minimal Symport/Antiport
- Applying Evolution Strategies for Chest Radiographs Segmentation
- Nash equilibria set computing in finite extended games
- Graph Coloring using Peer-to-Peer Networks
- The graphic representations for the one-dimensional solutions of problem from elastic mechanic deformations of two-component mixture
- An Approach to Shorten Digital Signature Length
- Cryptoschemes Based on New Signature Formation Mechanism
