Deterministic Weak-and-Marked Petri Net Languages are Regular.
S. Gaubert and A. Giua. IEEE-TAC, 41(12), Dec. 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.