Communicative P systems with minimal cooperation

DOI10.1007/978-3-540-31837-8_9MaRDI QIDQ5316648zbMATH OpenOpenAlexFDO

Authors Artiom Alhazov, Yurii Rogozhin, Sergey Verlan, M. Margenstern, Vladimir Rogojin

Publication date 14 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes
• On generalized communicating P systems with minimal interaction rules
• On the size of P systems with minimal symport/antiport
• Generating languages by P systems with minimal symport/antiport
• On the power of P systems with symport rules

Cited in

(5)

• Minimizing evolution communication P systems and automata
• Modelling queues in transportation networks using P systems
• Minimal communication in a distributed discrete-event system
• Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes
• Generalized communicating P systems

This page was built for publication: Communicative P systems with minimal cooperation

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