On reduced fuzzy multiset finite automata

Shamsizadeh, Marzieh; Zahedi, M. M.

doi:10.1007/s00500-022-07549-z

Cited by 5 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, different types of automata demonstrate rich and exciting properties that could be applied to modeling and simulating different types of epidemics, and we refer to [2,[9][10][11][12][13] for details. In addition, there has been limited research on the application of automata theory to analyze disease propagation.…”

Section: Introductionmentioning

confidence: 99%

Recognizable Languages of k-Forcing Automata

Shamsizadeh,

Zahedi,

Abolpour

et al. 2024

MCA

Self Cite

View full text Add to dashboard Cite

In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs. Moreover, we study and discuss the language of k-forcing automata for particular graphs. Also, for some graphs with different k-forcing sets, we study the languages of their k-forcing automata. In addition, for some given recognizable languages, we study the structure of graphs. After that, we show that k-forcing automata arising from isomorph graphs are also isomorph. Also, we present the style of words that can be recognized with k-forcing automata. Moreover, we introduce the structure of graphs the k-forcing automata arising from which recognize some particular languages. To clarify the notions and the results obtained in this study, some examples are submitted as well.

show abstract

Section: Introductionmentioning

confidence: 99%

Recognizable Languages of k-Forcing Automata

Shamsizadeh,

Zahedi,

Abolpour

et al. 2024

MCA

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several researchers have contributed to the growth of the fuzzy automata theory. Among these works, the work of Jin and his coworkers (Jin et al, 2013) is directed towards the algebraic study of fuzzy automata based on Po-monoids; the work of Abolpour and Zahedi (Abolpour et al, 2020;Abolpour and Zahedi, 2017) is directed towards the use of categorical concepts in the study of general fuzzy automata with membership values in different lattice structures; the work of Qiu (2001Qiu ( , 2002 is directed towards the algebraic, topological and categorical study of fuzzy automata theory based on residuated lattices; the work of Peeva (1988Peeva ( , 1991 relates to the study of minimizing the states of fuzzy automata and its application to study pattern recognition; the work of Pal and their coworkers (Pal et al, 2019) is directed towards the study of fuzzy automaton based on the residuated and co-residuated lattice, the work of Shamsizadeh and coworkers (Shamsizadeh et al, 2021;Raisi Sarbizhan et al, 2022;Shamsizadeh and Zahedi, 2022;Shamsizadeh, 2022) is directed towards the study of fuzzy automaton based on graph theory and multiset theory and neutrosophic sets; Ghorani, Moghari and coworkers study fuzzy tree automata based on lattice-valued.…”

Section: Introductionmentioning

confidence: 99%

Isomorphism Between Two Vector General Fuzzy Automata

Sen¹,

Movahednia²,

Sen³

2023

Informatica

Self Cite

View full text Add to dashboard Cite

In this paper, at first, we define the notion of general fuzzy automaton over a field; we call this automaton vector general fuzzy automaton (VGFA). Moreover, we present the concept of max-min vector general fuzzy automaton. We show that if two max-min VGFA are similar, they constitute an isomorphism. After that, we prove that if two VGFA constitute an isomorphism with threshold α, they are equivalent with threshold α, where $\alpha \in [0,1]$. Also, some examples are given to clarify these new notions.

show abstract

“…In his study, Li [14] clearly examined a categorical approach to lattice-valued fuzzy automata. Shamsizadeh and her coworkers studied the graph concept for general fuzzy automata [25,33], and studied and investigated on the minimization of fuzzy multiset finite automaton [31,32]. Doostfatemeh and Kremer [5] introduced the concept of general fuzzy automata to emphasize the insufficiency of the current literature to deal with the applications which in turn depend on fuzzy automata as a modeling tool, assigning membership values to active states of a fuzzy automaton.…”

Section: Introductionmentioning

confidence: 99%

Vector General Fuzzy Automaton: A Refining Analyzing

Shamsizadeh,

Abolpour,

Movahednia

et al. 2023

Int. J. Anal. Appl.

View full text Add to dashboard Cite

This study aims to investigate the refining relation between two vector general fuzzy automata (VGFA) and prove that refining relation is an equivalence relation. Moreover, Also, we prove that if there exists a refining equivalence between two VGFA, then they have the same language. After that, by considering the notion of refining equivalence, we present the quotient of VGFA. In particular, we show that any quotient of a given VGFA and the VGFA itself have the same language. Furthermore, using the quotient VGFA, we obtain a minimal VGFA with the same language.

show abstract

On reduced fuzzy multiset finite automata

Cited by 5 publications

References 28 publications

Recognizable Languages of k-Forcing Automata

Recognizable Languages of k-Forcing Automata

Isomorphism Between Two Vector General Fuzzy Automata

Vector General Fuzzy Automaton: A Refining Analyzing

Contact Info

Product

Resources

About