11 citations · 31 across the 6 of their papers we have counts for
6 papers
Sleptsov Nets are Turing-complete
Bernard Berthomieu, Dmitry A. Zaitsev
The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. R…
Computing with Modular Robots
Genaro J. Martinez, Andrew Adamatzky, Ricardo Q. Figueroa +4
Propagating patterns are used to transfer and process information in chemical and physical prototypes of unconventional computing devices. Logical values are represented by fronts…
Strong Sleptsov Net is Turing-Complete
Dmitry A. Zaitsev
It is known that a Sleptsov net, with multiple firing a transition at a step, runs exponentially faster than a Petri net opening prospects for its application as a graphical langua…
k-neighborhood for Cellular Automata
Dmitry A. Zaitsev
A neighborhood for d-dimensional cellular automata is introduced that spans the range from von Neumann to Moore neighborhood using a parameter which represents the dimension of hyp…
Small Polynomial Time Universal Petri Nets
Dmitry A. Zaitsev
The time complexity of the presented in 2013 by the author small universal Petri nets with the pairs of places/transitions numbers (14,42) and (14,29) was estimated as exponential.…
A Small Universal Petri Net
Dmitry A. Zaitsev
A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2…