• Title/Summary/Keyword: product semigroups

Search Result 15, Processing Time 0.022 seconds

THE DIRECT PRODUCT OF RIGHT CONGRUENCES

  • Oehmke, Robert-H.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.565-570
    • /
    • 1998
  • In a number of earlier papers the study of the structure of semigroups has been approached by means of right congruences. Such n approach seems appropriate since a right congruence is one of the possible analogs of both the right ideal of a ring and the subgroup in a group. Each of these substructures plays a strong role in the study of the structure of their respective systems. in both the ring and the group the internal direct product is nat-urally and effectively defined. however what such an internal direct product should be for two right congruences of a semigroup is not so clear. In this paper we will offer a possible definition and consider some of the consequences of it. We will also extend some of these results to automata.

A GENERALIZATION OF FUZZY SUBSEMIGROUPS IN SEMIGROUPS

  • Kang, Mee Kwang;Ban, Hee Young;Yun, Sang Wook
    • The Pure and Applied Mathematics
    • /
    • v.20 no.2
    • /
    • pp.117-127
    • /
    • 2013
  • As a generalization of fuzzy subsemigroups, the notion of ${\varepsilon}$-generalized fuzzy subsemigroups is introduced, and several properties are investigated. A condition for an ${\varepsilon}$-generalized fuzzy subsemigroup to be a fuzzy subsemigroup is considered. Characterizations of ${\varepsilon}$-generalized fuzzy subsemigroups are established, and we show that the intersection of two ${\varepsilon}$-generalized fuzzy subsemigroups is also an ${\varepsilon}$-generalized fuzzy subsemigroup. A condition for an ${\varepsilon}$-generalized fuzzy subsemigroup to be ${\varepsilon}$-fuzzy idempotent is discussed. Using a given ${\varepsilon}$-generalized fuzzy subsemigroup, a new ${\varepsilon}$-generalized fuzzy subsemigroup is constructed. Finally, the fuzzy extension of an ${\varepsilon}$-generalized fuzzy subsemigroup is considered.

THE SEMIGROUPS OF BINARY SYSTEMS AND SOME PERSPECTIVES

  • Kim, Hee-Sik;Neggers, Joseph
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.4
    • /
    • pp.651-661
    • /
    • 2008
  • Given binary operations "*" and "$\circ$" on a set X, define a product binary operation "$\Box$" as follows: $x{\Box}y\;:=\;(x\;{\ast}\;y)\;{\circ}\;(y\;{\ast}\;x)$. This in turn yields a binary operation on Bin(X), the set of groupoids defined on X turning it into a semigroup (Bin(X), $\Box$)with identity (x * y = x) the left zero semigroup and an analog of negative one in the right zero semigroup (x * y = y). The composition $\Box$ is a generalization of the composition of functions, modelled here as leftoids (x * y = f(x)), permitting one to study the dynamics of binary systems as well as a variety of other perspectives also of interest.

E-Inversive Γ-Semigroups

  • Sen, Mridul Kanti;Chattopadhyay, Sumanta
    • Kyungpook Mathematical Journal
    • /
    • v.49 no.3
    • /
    • pp.457-471
    • /
    • 2009
  • Let S = {a, b, c, ...} and ${\Gamma}$ = {${\alpha}$, ${\beta}$, ${\gamma}$, ...} be two nonempty sets. S is called a ${\Gamma}$-semigroup if $a{\alpha}b{\in}S$, for all ${\alpha}{\in}{\Gamma}$ and a, b ${\in}$ S and $(a{\alpha}b){\beta}c=a{\alpha}(b{\beta}c)$, for all a, b, c ${\in}$ S and for all ${\alpha}$, ${\beta}$ ${\in}$ ${\Gamma}$. An element $e{\in}S$ is said to be an ${\alpha}$-idempotent for some ${\alpha}{\in}{\Gamma}$ if $e{\alpha}e$ = e. A ${\Gamma}$-semigroup S is called an E-inversive ${\Gamma}$-semigroup if for each $a{\in}S$ there exist $x{\in}S$ and ${\alpha}{\in}{\Gamma}$ such that a${\alpha}$x is a ${\beta}$-idempotent for some ${\beta}{\in}{\Gamma}$. A ${\Gamma}$-semigroup is called a right E-${\Gamma}$-semigroup if for each ${\alpha}$-idempotent e and ${\beta}$-idempotent f, $e{\alpha}$ is a ${\beta}$-idempotent. In this paper we investigate different properties of E-inversive ${\Gamma}$-semigroup and right E-${\Gamma}$-semigroup.