Catalytic and communicating Petri nets are Turing complete
From MaRDI portal
Publication:476166
DOI10.1016/J.IC.2014.08.008zbMATH Open1309.68137DBLPjournals/iandc/CiobanuP14OpenAlexW2009828777WikidataQ57936516 ScholiaQ57936516MaRDI QIDQ476166FDOQ476166
Gabriel Ciobanu, G. Michele Pinna
Publication date: 28 November 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2014.08.008
Recommendations
Cites Work
- Membrane computing. An introduction.
- Title not available (Why is that?)
- Computationally universal P systems without priorities: Two catalysts are sufficient
- The power of communication: P systems with symport/antiport
- P systems with minimal parallelism
- Flattening the Transition P Systems with Dissolution
- Membrane Computing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Contextual nets
- On the \(\omega\)-language expressive power of extended Petri nets
- Synthesis Problem for Petri Nets with Localities
- Catalytic Petri Nets Are Turing Complete
- Title not available (Why is that?)
- Labeled Step Sequences in Petri Nets
- Petri nets with localities and testing
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
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)