Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Marzieh Shamsizadeh"'
Autor:
Marzieh Shamsizadeh, Parvaneh Lo′lo
Publikováno v:
Neutrosophic Sets and Systems, Vol 56, Pp 410-428 (2023)
Interval-valued neutrosophic sets have been shown to provide a limited platform for computational complexity, but neutrosophic sets are suitable for it. The neutrosophic sets are a suitable mechanism for interpreting the philosophical problems of rea
Externí odkaz:
https://doaj.org/article/4d66766bf66a4c79be04eadf61f83730
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:
Marzieh Shamsizadeh
Publikováno v:
Neutrosophic Sets and Systems, Vol 49, Pp 509-530 (2022)
In this paper, first of all, considering the notions of single-valued neutrosophic and general fuzzy automata we present the concept of single-valued neutrosophic general machine, to simplicity, SVNGM. Also, for a given SVNGM M, we give the concept o
Externí odkaz:
https://doaj.org/article/bfaa9a764c394b27b48c786d5b80f62c
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
Publikováno v:
Informatica. :1-17
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-m
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
Publikováno v:
Journal of Algebraic Hyperstructures and Logical Algebras. 2:33-46
The present paper is an attempt to suggest and scrutinize tense operators in the dynamic logic $textbf{B}$ which is regarded as a set of propositions about the general fuzzy automaton $ tilde{F} $, in which its underlying structure has been a bounded
Publikováno v:
The Computer Journal.
This paper defines a novel graph constructed on a residuated lattice using a specific definition of the fuzzy graph (called $L$-graph). These types of graphs also have applications in libraries, pharmacies and machine facilities. Among these applicat