Deterministic catalytic systems are not universal
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- A guide to membrane computing.
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Computing with membranes
- Developments in Language Theory
- Membrane computing. An introduction.
- On the analysis of Petri nets with static priorities
- The power of communication: P systems with symport/antiport
Cited in
(10)- Using well-structured transition systems to decide divergence for catalytic P systems
- Catalytic P systems, semilinear sets, and vector addition systems
- Promoters and inhibitors in purely catalytic P systems
- Membrane Computing
- Properties of membrane systems
- Mathematical Foundations of Computer Science 2003
- Priorities, promoters and inhibitors in deterministic non-cooperative P systems
- scientific article; zbMATH DE number 6829365 (Why is no real title available?)
- Implementation and Application of Automata
- P systems and topology: some suggestions for research
This page was built for publication: Deterministic catalytic systems are not universal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860859)