Regular string token fuzzy Petri nets

Volume 30, Issue 2, pp 89--100 https://doi.org/10.22436/jmcs.030.02.01
Publication Date: December 02, 2022 Submission Date: April 25, 2022 Revision Date: October 23, 2022 Accteptance Date: November 10, 2022

Authors

A. J. Kaspar - Department of Mathematics , SRM Institute of Science and Technology, Kattankulathur, 6032 203, India. D. K. Sheena Christy - Department of Mathematics , SRM Institute of Science and Technology, Kattankulathur, 6032 203, India.


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.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

A. J. Kaspar, D. K. Sheena Christy, Regular string token fuzzy Petri nets, Journal of Mathematics and Computer Science, 30 (2023), no. 2, 89--100

AMA Style

Kaspar A. J., Sheena Christy D. K., Regular string token fuzzy Petri nets. J Math Comput SCI-JM. (2023); 30(2):89--100

Chicago/Turabian Style

Kaspar, A. J., Sheena Christy, D. K.. "Regular string token fuzzy Petri nets." Journal of Mathematics and Computer Science, 30, no. 2 (2023): 89--100


Keywords


MSC


References