Search. Read. Cite.

Easy to search. Easy to read. Easy to cite with credible sources.

Information Technology Journal

Year: 2008  |  Volume: 7  |  Issue: 4  |  Page No.: 689 - 693

Petri Net Methods of Constructing Kleene-Closure Operations of Regular Languages

WenJuan Lian, Hao Fan, YuYue Du and YongQuan Liang

Abstract

It 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.

Cited References Fulltext