On generalized communicating P systems with minimal interaction rules

DOI10.1016/J.TCS.2010.08.020zbMath1207.68138OpenAlexW2054751750MaRDI QIDQ616499

Sergey Verlan, Erzsébet Csuhaj-Varjú

Publication date: 10 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.020

zbMATH Keywords

formal languagesP systemscomputational completenessantiportminimal interactionssymport

Mathematics Subject Classification ID

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

Related Items (2)

Further results on generalised communicating P systems ⋮ Alternative representations of P systems solutions to the graph colouring problem

Cites Work

• Unnamed Item
• Unnamed Item
• The power of communication: P systems with symport/antiport
• Generalized communicating P systems
• Tissue P systems.
• Membrane computing. An introduction.
• Computational Completeness of Tissue P Systems with Conditional Uniport
• Partial Halting in P Systems Using Membrane Rules with Permitting Contexts
• Producer/Consumer in Membrane Systems and Petri Nets
• Membrane Computing

This page was built for publication: On generalized communicating P systems with minimal interaction rules