مقاله

general complex fuzzy transformation semigroups in automata

mohammad horry, shahid chamran university of kerman, kerman, iran

دانلود متن کاملرایگان، با حساب کاربری؛ ثبت نام با گوگل چند ثانیه است

چکیده(به انگلیسی؛ چکیده‌ی فارسی در دسترس نیست)

in this paper, we define the concepts of a complex fuzzy subset and a complex fuzzy finite state automaton. then we extend the notion of a complex fuzzy finite state automaton and introduce the notion of a general complex fuzzy automaton. after that we define the concept of a max- min general complex fuzzy automaton and construct some equivalence relations and some congruence relations in a max-min general complex fuzzy automaton and obtain different types of monoids in a max-min general complex fuzzy automaton and define a homomorphism between them. then we define the concepts of a general complex fuzzy transformation semi- group, a faithful general complex fuzzy transformation semigroup and a faithful general complex fuzzy transformation semigroup associated with a max-min general complex fuzzy automaton. then we derive relationships between a max-min general complex fuzzy automaton and a general complex fuzzy transformation semigroup.

اسناد مشابه

  • An Upper Bound for the Complexity of Transformation Semigroups

    سند علمی۲۰۰۳STUART W. MARGOLIS, BRET TILSON

    A transformation semigroup (ts) X = (Q,, S,) in this paper consists of a finite set of states Qx and a subsemigroup of transformations S, of PF(Q,), the monoid of all partial functions on Q, with composition as multiplication. For n > 1, ii’ denotes the transformation monoid (tm)

  • An upper bound for the complexity of transformation semigroups

    مقاله‌ی دسترسی آزاد۱۹۸۱Journal of AlgebraStuart WMargolis, BretTilson

  • I-homomorphism for BL-I-General L-fuzzy Automata

    مقاله۲۰۱۸journal of mahani mathematical research centerKhadijeh Abolpour, Marzieh Shamsizadeh, Mohammad Mehdi Zahedi

    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-intuitionistic general L-fuzzy automato

  • Simple and generalized T -fuzzy bi-ideals of Γ-semigroup

    سند علمی۲۰۱۵S. Coumaressane, V. Chinnadurai, N. Thillaigovindan

    Abstract. In this paper, we introduce the concept of T−fuzzy interior ideal, T−fuzzy simple, T−fuzzy bi-ideal, and generalized T−fuzzy bi-ideal of a Γ−semigroup. We characterize Γ−semigroups through T−fuzzification. We find equivalent conditions on these fuzzy subsets in simple Γ

  • An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

    سند علمی۲۰۰۸BENJAMIN STEINBERG

    The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, Complexity of finite semigroups, Annals of Mathematics (2) 88 (1968), 128–160, motivated by the Prime Decomposition Theorem of K. Krohn and J. Rhodes, Algeb

  • minimal and statewise minimal intuitionistic general l-fuzzy automata

    مقالهiranian journal of fuzzy systemsm. shamsizadeh, department of mathematics, graduate university of advanced technology, kerman, iran m. m. zahedi, department of mathematics, graduate university of advanced tech- nology, kerman, iran

    in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove tha