No abstract

No abstract

Abstract. Motivated by the studies done by G. Siromoney et al. (1973) and Alexandru Mateescu et al. (1998) we examine the language theoretic results related to shuffle on trajectories by making use of Siromoney array grammars such as (R :

No abstract

No abstract

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

No abstract