CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES

DOI10.1142/S012905410600367XzbMath1088.68053OpenAlexW1970858604MaRDI QIDQ3379510

Artiom Alhazov, Marion Oswald, Rudolf Freund

Publication date: 6 April 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905410600367x

zbMATH Keywords

universalitymembrane computingcellsdescriptional complexityantiport rulestissue systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items

Properties of Membrane Systems ⋮ The computational complexity of tissue P systems with evolutional symport/antiport rules ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ (Tissue) P systems with cell polarity

Cites Work

• Unnamed Item
• The power of communication: P systems with symport/antiport
• Petri net algorithms in the theory of matrix grammars
• Tissue P systems.