Generalized communicating P systems

DOI10.1016/j.tcs.2008.04.008zbMath1151.68022OpenAlexW2006413849MaRDI QIDQ953554

Maurice Margenstern, Marian Gheorghe, Sergey Verlan, Francesco Bernardini

Publication date: 6 November 2008

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

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

zbMATH Keywords

formal languagesP systemsantiportminimal interactionssymportuniversal computations

Mathematics Subject Classification ID

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

Related Items (5)

Automata and processes on multisets of communicating objects ⋮ Further results on generalised communicating P systems ⋮ On generalized communicating P systems with minimal interaction rules ⋮ Spiking neural P systems: matrix representation and formal verification ⋮ Modelling Queues in Transportation Networks Using P Systems

Cites Work

• The power of communication: P systems with symport/antiport
• Universality of the chip-firing game
• Computing with membranes
• Membrane computing. An introduction.
• Cell communication in tissue \(P\) systems: universality results
• MINIMAL COOPERATION IN SYMPORT/ANTIPORT TISSUE P SYSTEMS
• Computational Completeness of Tissue P Systems with Conditional Uniport
• Unconventional Computation
• Membrane Computing
• Two railway circuits: A universal circuit and an NP-difficult one
• Membrane systems with carriers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized communicating P systems