Abstract
Fuzzy Petri nets are a type of classical Petri nets designed to deal with imprecise and ambiguous data, that have been widely used to represent fuzzy production rules and fuzzy rule-based reasoning. In this paper, we introduce a new model called string token fuzzy Petri nets to generate fuzzy regular languages. Also, we study the equivalences of fuzzy regular grammar and regular string token fuzzy Petri net and establish some closure properties such as union, catenation, kleene closure, reversal, homomorphism and inverse homomorphism of the languages generated by the regular string token fuzzy Petri nets.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
