On membrane hierarchy in P systems
From MaRDI portal
Publication:1779299
DOI10.1016/j.tcs.2004.05.007zbMath1080.68035MaRDI 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 system; Membrane computing; Hierarchy; Counter machine; Semilinear set; System with tentacles; Two-way multihead finite automaton
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA, Contextual array grammars and array P systems, Context-free languages can be accepted with absolutely no space overhead, P AUTOMATA WITH RESTRICTED POWER, P SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH
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