ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
From MaRDI portal
Publication:5462670
DOI10.1142/S0129054105003236zbMath1161.68470OpenAlexW2149567454MaRDI QIDQ5462670
Hsu-Chun Yen, Oscar H. Ibarra, Zhe Dang
Publication date: 3 August 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054105003236
Related Items (6)
Flat maximal parallelism in P systems with promoters ⋮ On the degree of parallelism in membrane systems ⋮ Automata and processes on multisets of communicating objects ⋮ Computing with cells: membrane systems – some complexity issues ⋮ Automata on Multisets of Communicating Objects ⋮ (Tissue) P systems working in the \(k\)-restricted minimally or maximally parallel transition mode
Cites Work
- Unnamed Item
- Unnamed Item
- Persistence of vector replacement systems is decidable
- On the reachability problem for 5-dimensional vector addition systems
- Computing with membranes
- A guide to membrane computing.
- Catalytic P systems, semilinear sets, and vector addition systems
- Commutative grammars: The complexity of uniform word problems
- Turing machines with restricted memory access
- Counter machines and counter languages
This page was built for publication: ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
