11 citations · 31 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013★ 3 cited
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.…
cs.FL2013★ 5 cited
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…