نتایج جستجو برای: semilattices of left and right simple ordered semigroups
تعداد نتایج: 24110047 فیلتر نتایج به سال:
Zadeh in 1965 introduce the concept of a fuzzy set which now have a wide range of applications in various fields of Engineering Sciences, Computer Science and Management Sciences. It is worth mentioning here that for applications of fuzzy sets mostly associative algebraic structures are used such as in 2003, Mordeson, Malik and Kuroki have discovered the applications of fuzzy semigroups in fuzz...
in this thesis, first the notion of weak mutual associativity (w.m.a.) and the necessary and sufficient condition for a $(l,gamma)$-associated hypersemigroup $(h, ast)$ derived from some family of $lesssim$-preordered semigroups to be a hypergroup, are given. second, by proving the fact that the concrete categories, semihypergroups and hypergroups have not free objects we will introduce t...
This paper characterizes directed graphs which are Cayley graphs of strong semilattices of groups and, in particular, strong chains of groups, i.e. of completely regular semigroups which are also called Clifford semigroups. © 2006 Elsevier B.V. All rights reserved.
a simple, rapid and low-cost scanner spectroscopy method for the glucose determination by utilizing glucose oxidase and cdte/tga quantum dots as chromoionophore has been described. the detection was based on the combination of the glucose enzymatic reaction and the quenching effect of h2o2 on the cdte quantum dots (qds) photoluminescence.in this study glucose was determined by utilizing glucose...
the purpose of the present study was to see which one of the two instruction-processing instruction (pi) and meaningful output based instruction (mobi) accompanied with prompt and recast- is more effective on efl learners’ writing accuracy. in order to homogenize the participants in term of language proficiency a preliminary english test (pet) was administrated between 74 intermediate students ...
Cardinalities and lattice structures which are attainable by semilattices of ordered compactifications of completely regular ordered spaces are examined. Visliseni and Flachsmeyer have shown that every infinite cardinal is attainable as the cardinality of a semilattice of compactifications of a Tychonoff space. Among the finite cardinals, however, only the Bell numbers are attainable as cardina...
The most important tool for classifying recognizable languages is Eilenberg’s variety theorem [1], which gives a one-to-one correspondence between (pseudo)-varieties of finite semigroups and varieties of recognizable languages. Varieties of recognizable languages are classes of recognizable languages closed under union, intersection, complement, left and right quotients and inverse morphisms. R...
chapter two presents three m-admissible function algebras ab, bd, and sl, to construct the universal abelian, band, and semilattice compactifications, respectively. the main results are (11.3), (12.3), and (12.4). some inclusion relationships between these function algebras and the other well-known ones, presented in section 8, are made via the devico of compactifications. chpter three is about...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید