Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Khadijeh Abolpour"'
Publikováno v:
Journal of Mahani Mathematical Research, Vol 12, Iss 2, Pp 57-75 (2023)
In this paper, we define the concepts of single-valued neutrosophic general automaton, complete and deterministic single-valued neutrosophic general automaton. We present a minimal single-valued neutrosophic general automaton that preserves the langu
Externí odkaz:
https://doaj.org/article/f9a3b2071c054a8aa8935771e0064125
Publikováno v:
Mathematical and Computational Applications, Vol 29, Iss 3, p 32 (2024)
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
Externí odkaz:
https://doaj.org/article/7f838eaaa5794374814a1d8e7f382582
Autor:
khadijeh abolpour
Publikováno v:
پژوهشهای ریاضی, Vol 7, Iss 2, Pp 177-190 (2021)
The fundamental role of algebraic properties in the development of the basics of computer science has led researchers to study the concepts of fuzzy automaton separatedness, connectedness, and reversibility on a large scale.In this paper, the general
Externí odkaz:
https://doaj.org/article/2265bdae6dc0422394936d11fd16bc79
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 1, Iss 2, Pp 251-262 (2020)
In the current study, by a general fuzzy automaton we aim at showing a set of propositions related to a given automaton showing that the truth-values are depended on thestates, inputs and membership values of active states at time t. This new approac
Externí odkaz:
https://doaj.org/article/4dcd2d74019c4907b26873ebb2caff0c
Publikováno v:
Journal of Mahani Mathematical Research, Vol 7, Iss 2, Pp 57-77 (2018)
Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitioni
Externí odkaz:
https://doaj.org/article/ec8f1bd152e34c1d95a5864bc2181b79
Autor:
Khadijeh Abolpour
Publikováno v:
Fuzzy Sets and Systems. 460:186-199
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33725d3841f4045f26ea97d4874d6893
https://doi.org/10.1016/j.fss.2023.01.012
https://doi.org/10.1016/j.fss.2023.01.012
Publikováno v:
The Computer Journal.
This study aims to investigate the algebraic properties of fuzzy multiset finite automaton (FMFA), giving a congruence relation. Using the equivalence classes, a minimal accessible complete FMFA is then presented. In addition, we define the concepts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0c4aa3225a048d303a2a99862fe633a
https://doi.org/10.1093/comjnl/bxac193
https://doi.org/10.1093/comjnl/bxac193
Publikováno v:
Filomat. 35:251-270
In the current study, we define the different L-valued operators on LB-valued general fuzzy automata or simply LB-valued GFA, where B is considered as a complete infinitely distributive lattice of propositions about the GFA. In particular, this study
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aea0b8beeb8dfe57253fae0f8895e27c
https://doi.org/10.2298/fil2101251a
https://doi.org/10.2298/fil2101251a
Autor:
khadijeh abolpour
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8a9cbf07551da5ab7d4a61e165d182d
https://doi.org/10.2139/ssrn.4026027
https://doi.org/10.2139/ssrn.4026027