For a given word and a String Token Petri Net (STPN), we can check whether the given STPN accepts the given word using parsing. Also, for a given regular expression, we can construct a STPN that accepts the given regular expression.
Parse Trees and Derivations
String-Token Petri Net can generate Regular Language has been proved here. Also, it has been proved that Regular Language originated by String-Token Petri Net are closed with respect to union and concatenation.
A two dimensional language is a collection of two dimensional words, which are rectangular array of symbols made up of finite alphabets. Fuzzy Petri nets are the generalization of classical Petri nets designed to deal with imprecise and ambiguous data which usually occurs in knowledge based systems, image processing, etc. They have been widely used to represent fuzzy production rules and fuzzy rule-based reasoning. In this paper, a new model called array token fuzzy Petri net to generate two dimensional fuzzy regular languages has been introduced. Array token fuzzy Petri nets are used to deal with impreciseness and uncertainties occurring in two dimensional regular languages. Furthermore, proved that for every two dimensional fuzzy regular grammar there exists an array token fuzzy Petri net that generates the same two dimensional fuzzy regular language and also establish some closure properties of the languages generated by array token fuzzy Petri net.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.