IEEE Transactions on Automatic Control, Vol.41, No.12, 1802-1803, 1996
Deterministic Weak-and-Marked Petri-Net Languages Are Regular
The intersection of tile class of deterministic weak and the class of deterministic marked Petri net languages is the das of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.