On membrane hierarchy in P systems

DOI10.1016/J.TCS.2004.05.007zbMath1080.68035OpenAlexW2045623879MaRDI QIDQ1779299

Oscar H. Ibarra

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

zbMATH Keywords

Communicating P systemMembrane computingHierarchyCounter machineSemilinear setSystem with tentaclesTwo-way multihead finite automaton

Mathematics Subject Classification ID

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

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