On membrane hierarchy in P systems
From MaRDI portal
Publication:1779299
DOI10.1016/j.tcs.2004.05.007zbMath1080.68035OpenAlexW2045623879MaRDI QIDQ1779299
Publication date: 1 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.007
Communicating P systemMembrane computingHierarchyCounter machineSemilinear setSystem with tentaclesTwo-way multihead finite automaton
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
P AUTOMATA WITH RESTRICTED POWER ⋮ On the computational power of swarm automata using agents with position information ⋮ On the hierarchy of swarm-automaton for the number of agents ⋮ Contextual array grammars and array P systems ⋮ P SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH ⋮ P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA ⋮ Context-free languages can be accepted with absolutely no space overhead
Cites Work
- On the computational complexity of membrane systems
- The power of communication: P systems with symport/antiport
- The chemical abstract machine
- Computing with membranes
- A guide to membrane computing.
- Some decision problems concerning semilinearity and commutation.
- Membrane computing. An introduction.
- Catalytic P systems, semilinear sets, and vector addition systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On membrane hierarchy in P systems