About \(P\) systems with symport/antiport

DOI10.1007/s00500-004-0396-1zbMath1101.68578OpenAlexW2089871046MaRDI QIDQ2576609

Pierluigi Frisco

Publication date: 13 December 2005

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

Full work available at URL: https://doi.org/10.1007/s00500-004-0396-1

zbMATH Keywords

Turing computabilityMembrane computingCounter automatonSymport/Antiport

Mathematics Subject Classification ID

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

Related Items (3)

Modeling Symport/Antiport P Systems with a Class of Hierarchical Petri Nets ⋮ Membrane automata for modeling biomolecular processes ⋮ ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The power of communication: P systems with symport/antiport
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Aspects of molecular computing. Essays dedicated to Tom Head on the occasion of his 70th birthday
• Computing with membranes
• The conformon-P system: a molecular and cell biology-inspired computability model
• Aspects of Molecular Computing
• Membrane Computing

This page was built for publication: About \(P\) systems with symport/antiport