Universal Sleptsov net

DOI10.1080/00207160.2017.1283410MaRDI QIDQ3177465zbMATH OpenOpenAlexFDO

Authors Dmitry A. Zaitsev

Publication date 25 July 2018

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2017.1283410

zbMATH Keywords

polynomial complexityTuring machinePetri netmultiple firinguniversal Sleptsov net

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 7357525
• Small universal networks of evolutionary processors
• Universal Petri net
• Small Weakly Universal Turing Machines
• Four Small Universal Turing Machines

Cites work

• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3806945 (Why is no real title available?)
• On the Computational Complexity of Algorithms
• On the computational complexity of spiking neural P systems
• P-completeness of Cellular Automaton Rule 110
• Small Weakly Universal Turing Machines
• Small universal non-deterministic Petri nets with inhibitor arcs
• State equations and equivalent transformations for timed Petri nets
• The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
• Universal Petri net
• Universality in elementary cellular automata

Cited in

(1)

• GPU based virtual machine for Sleptsov net computing

Describes a project that uses

Uses Software

• TINA

This page was built for publication: Universal Sleptsov net

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177465)