Triangular Array Token Petri Net and P System

Kalyani, T.; Raman, T. T.; Thomas, D. G.; Bhuvaneswari, K.; Ravichandran, P.

doi:10.1007/978-3-030-77102-7_5

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [32], another version of labeled Petri net called string token Petri net has been presented and studied by representing the labels of transitions with grammar's rules and tokens by strings over some alphabet. This string token Petri nets led to the study of characterization of family of picture languages recognized by array token Petri nets and its extension to the generation of graphs and trees [15,16,22,23,33].…”

Section: Introductionmentioning

confidence: 99%

Regular string token fuzzy Petri nets

Kaspar¹,

Christy²

2022

J. Math. Computer Sci.

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%