Computing with cells: membrane systems – some complexity issues

DOI10.1080/17445760701640266zbMath1151.68018OpenAlexW2155411098MaRDI QIDQ3532791

Oscar H. Ibarra, Andrei Păun

Publication date: 28 October 2008

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: http://oa.upm.es/2260/

zbMATH Keywords

context-sensitive languagesymport/antiport systemmembrane systemcatalytic system

Mathematics Subject Classification ID

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

Cites Work

• The power of communication: P systems with symport/antiport
• Membrane computing and complexity theory: A characterization of PSPACE
• Normal forms for spiking neural P systems
• P systems with minimal parallelism
• Simulating FAS-induced apoptosis by using P systems
• The method of forced enumeration for nondeterministic automata
• Computing with membranes
• Computationally universal P systems without priorities: Two catalysts are sufficient
• Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
• Relationships between nondeterministic and deterministic tape complexities
• A note on multihead automata and context-sensitive languages
• P Systems with Proteins on Membranes and Membrane Division
• Nondeterministic Space is Closed under Complementation
• Minimal Parallelism for Polarizationless P Systems
• ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
• SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS

This page was built for publication: Computing with cells: membrane systems – some complexity issues