On the computational complexity of membrane systems
From MaRDI portal
Publication:596128
DOI10.1016/j.tcs.2004.03.045zbMath1068.68060OpenAlexW2119227111MaRDI QIDQ596128
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.045
GeneratorAcceptorCatalytic systemCommunicating P systemMembrane computingReachabilitySemilinearSpace boundedSymport/antiport systemTime bounded
Related Items
Non-confluence in divisionless P systems with active membranes ⋮ On the computational complexity of P automata ⋮ P systems with proteins on membranes characterize PSPACE ⋮ On membrane hierarchy in P systems ⋮ P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA ⋮ ON THE POWER OF DETERMINISTIC AND SEQUENTIAL COMMUNICATING P SYSTEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The chemical abstract machine
- Computing with membranes
- Computationally universal P systems without priorities: Two catalysts are sufficient
- P systems with symport/Antiport rules: The traces of objects
- A guide to membrane computing.
- Some decision problems concerning semilinearity and commutation.
- Membrane computing. An introduction.
- Relationships between nondeterministic and deterministic tape complexities
- A note on multihead automata and context-sensitive languages
- COMPUTING BY COMMUNICATION IN NETWORKS OF MEMBRANES
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Tally languages and complexity classes
- Mathematical Foundations of Computer Science 2003
- Turing machines with restricted memory access
- Counter machines and counter languages
- A Note Concerning Nondeterministic Tape Complexities
- Membrane Computing
