Information Technology Journal1812-56381812-5646Asian Network for Scientific Information10.3923/itj.2008.689.693LianWenJuan FanHao DuYuYue LiangYongQuan 4200874It has been proved that regular language is a subclass of Petri
net languages. Standard properly end Petri net, a subclass of Petri nets
is defined in the related references, and the equivalency between a standard
properly end Petri net and a regular language has been investigated. Thus,
the Petri net constructing methods of Kleene closure operations with and
without an ε-empty label in regular expressions are presented respectively
in this study. By the methods, the net model of producing regular language
L* can be constructed from that of producing regular language L. It is
proved that a standard properly end Petri net language of Kleene closure
operations is close.]]>Du, Y.Y., C.J. Jiang and M.C. Zhou,200737643654Du, Y.Y., C.J. Jiang and M.C. Zhou,2008389399Jiang, C.J.,19962413151322Jiang, C.J. and G.J. Liu,200629274278John, E., R. Motwani, J.D. Ullman,20042nd Edn.pp: 521pp: 521Murata, T.,198977541580Peterson, J.,19811st Edn.,pp: 288pp: 288Scarpelli, H., F. Gomide and R. Yager,19964282294Wang, H.Q., C.J. Jiang and S.Y. Liao,200016834843Wu, Z.H.,199417852858Zeng, Q.,20072007pp: 11011106Zeng, Q. and H. Duan,200722359363