P systems without priorities are computationally universal
From MaRDI portal
Recommendations
- Computationally universal P systems without priorities: Two catalysts are sufficient
- scientific article; zbMATH DE number 1421069
- Priorities without priorities: representing preemption in psi-calculi
- Membrane Computing
- Priority and maximal progress are completely axiomatisable (extended abstract)
- scientific article; zbMATH DE number 2080944
- scientific article; zbMATH DE number 1735637
- P systems with minimal parallelism
- On the Axiomatizability of Priority
- On the axiomatisability of priority
Cited in
(12)- The power of catalysts and priorities in membrane systems
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Catalytic P systems, semilinear sets, and vector addition systems
- P systems with proteins: a new frontier when membrane division disappears
- Small (purely) catalytic P systems simulating register machines
- scientific article; zbMATH DE number 2060759 (Why is no real title available?)
- scientific article; zbMATH DE number 2080944 (Why is no real title available?)
- Membrane Computing
- On the computational complexity of membrane systems
- On maximal parallel application of rules in rewriting P systems
- P systems with symport/antiport simulating counter automata
- Using well-structured transition systems to decide divergence for catalytic P systems
This page was built for publication: P systems without priorities are computationally universal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413843)
