Deterministic weak-and-marked Petri net languages are regular
Stéphane Gaubert, Alessandro Giua · IEEE Transactions on Automatic Control · 1996
The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.