Computational Completeness of Tissue P Systems with Conditional Uniport

DOI10.1007/11963516_33zbMATH Open1187.68244OpenAlexW1557330149MaRDI QIDQ3591007FDOQ3591007

Authors: Sergey Verlan, Francesco Bernardini, Marian Gheorghe, M. Margenstern 

Publication date: 3 September 2007

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11963516_33

Recommendations

• Membrane Computing
• CELL/SYMBOL COMPLEXITY OF TISSUE P SYSTEMS WITH SYMPORT/ANTIPORT RULES
• Developments in Language Theory
• The computational power of monodirectional tissue P systems with symport rules
• Computational power of tissue P systems for generating control languages

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (4)

• (Tissue) P systems with cell polarity
• On generalized communicating P systems with minimal interaction rules
• Generalized communicating P systems
• Properties of membrane systems

This page was built for publication: Computational Completeness of Tissue P Systems with Conditional Uniport

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591007)