On the power of membrane division in P systems

DOI10.1016/j.tcs.2004.03.053zbMath1078.68038OpenAlexW2009647777MaRDI QIDQ1882915

Takashi Yokomori, Yasuhiro Suzuki, Hiroshi Tanaka, Gheorghe Păun

Publication date: 1 October 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.053

zbMATH Keywords

SAT problemUniversalityMembrane computingRecursively enumerable language

Mathematics Subject Classification ID

Related Items (15)

From regulated rewriting to computing with membranes: collapsing hierarchies ⋮ Membrane computing to enhance time efficiency of minimum dominating set ⋮ On the verification of membrane systems with dynamic structure ⋮ Time-free solution to SAT problem using P systems with active membranes ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ A Biologically Inspired Model with Fusion and Clonation of Membranes ⋮ The computational power of timed P systems with active membranes using promoters ⋮ Time-free solution to SAT problem by tissue P systems ⋮ Languages generated by P systems with active membranes ⋮ P systems with mobile membranes ⋮ Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes ⋮ Characterizing Membrane Structures Through Multiset Tree Automata ⋮ Simple, Enhanced and Mutual Mobile Membranes ⋮ Computational efficiency of dissolution rules in membrane systems ⋮ Time-free Solution to Independent Set Problem using P Systems with Active Membranes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri net algorithms in the theory of matrix grammars
• Computing with membranes
• P systems with energy accounting^∗
• A CHARACTERIZATION OF PARIKH SETS OF ET0L LANGUAGES IN TERMS OF P SYSTEMS
• COMPUTING WITH MEMBRANES (P SYSTEMS): A VARIANT

This page was built for publication: On the power of membrane division in P systems