Catalytic and communicating Petri nets are Turing complete
From MaRDI portal
(Redirected from Publication:476166)
Recommendations
Cites work
- scientific article; zbMATH DE number 3850481 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1231592 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 1973117 (Why is no real title available?)
- scientific article; zbMATH DE number 1927584 (Why is no real title available?)
- scientific article; zbMATH DE number 3806945 (Why is no real title available?)
- Catalytic Petri nets are Turing complete
- Computationally universal P systems without priorities: Two catalysts are sufficient
- Contextual nets
- Flattening the transition P systems with dissolution
- Labeled Step Sequences in Petri Nets
- Membrane Computing
- Membrane computing. An introduction.
- On the \(\omega\)-language expressive power of extended Petri nets
- P systems with minimal parallelism
- Petri nets with localities and testing
- Synthesis problem for Petri nets with localities
- The power of communication: P systems with symport/antiport
Cited in
(7)
This page was built for publication: Catalytic and communicating Petri nets are Turing complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476166)