Regular Expression Constructing Methods using no ε-label Petri Nets
Hao Fan · Jisuanji fangzhen · 2008
How to create a Petri net that the language it produced is equal to a given language express is an important problem in the Petri nets language theory.To transform the regular expression to Petri nets(no e-label) is more difficult.The properties about the standard properly end Petri net(no e-label) language operations,such as connection,union,kleene-closure and concurrence,will be researched.Based on those foundations,the transformation algorithms from the regular expression to the standard properly end Petri nets(no e-label) are given.As an essential complementarily of the formal language theory,the algorithms from the regular expression with concurrence operation to standard properly end Petri nets(no e-label) are also given.