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 membr...
Main Authors: | Artiom Alhazov, Yurii Rogozhin |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2006-12-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/files/csjm/v14-n3/v14-n3-(pp299-323).pdf |
Similar Items
-
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node
by: Artiom Alhazov, et al.
Published: (2008-11-01) -
Modelling Inflections in Romanian Language by P Systems with String Replication
by: Artiom Alhazov, et al.
Published: (2009-12-01) -
Symport and antiport mechanisms of human glutamate transporters
by: Biao Qiu, et al.
Published: (2023-05-01) -
Membrane Systems Languages Are Polynomial-Time Parsable
by: Artiom Alhazov, et al.
Published: (2010-11-01) -
Nine Universal Circular Post Machines
by: Artiom Alhazov, et al.
Published: (2002-11-01)