نتایج جستجو برای: Multiset topology
تعداد نتایج: 68763 فیلتر نتایج به سال:
In this paper, we show the redundancies of multiset topological spaces. It is proved that $(P^star(U),sqsubseteq)$ and $(Ds(varphi(U)),subseteq)$ are isomorphic. It follows that multiset topological spaces are superfluous and unnecessary in the theoretical view point.
athemat s.2012.1 Abstract Rough set theory is a powerful mathematical tool for dealing with inexact, uncertain or vague information. The core concept of rough set theory are information systems and approximation operators of approximation spaces. In this paper, we define and investigate three types of lower and upper multiset approximations of any multiset. These types based on the multiset bas...
Lately, some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood just looking at their topology, that is, information flow. This line of research is very promising for several aspects: its res...
In this article we established the concept of multi-continuity in minimal structure spaces (in short $\mathscr{M}$ space) and notion product space multiset topological space. Continuity between $\mathscr{M}$-space, generalized topology ideal spaces. We have investigated some basic properties $\mathscr{M}$–continuity space, such as composition $\mathscr{M}$–continuous functions, functions etc.
We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriting with existential quantification and constrained multiset rewriting. We obtain ν-MSRs, where we rewrite multisets of atomic formulae, in which some names may be restricted. We prove that ν-MSRs are equivalent to a class of Pe...
The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...
The paper addresses an approach to ordinal assessment of alternatives based on assignment of elements into an ordinal scale. Basic versions of the assessment problems are formulated while taking into account the number of levels at a basic ordinal scale [1,2,...,l] and the number of assigned elements (e.g., 1,2,3). The obtained estimates are multisets (or bags) (cardinality of the multiset equa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید