Kleene-closure operation constructing method about regular language with Petri net
Hao Fan · Computer Engineering and Applications Journal · 2010
Some brilliant conclusions have been made about the relations between Petri net languages and Chomsky grammar system.Standard properly end Petri net,a kind of subclass of Petri nets is defined.This subclass of Petri nets'language is equal to regular language.Based on this kind of Petri net,constructing methods of kleene closure operations with and without an empty label in regular expressions are presented respectively.It is also proved that a standard properly end Petri net language of Kleene closure operations is close.