11 citations · 31 across the 6 of their papers we have counts for
1 paper · 1 filter
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…