After the research on naBL-algebras gained by non-associative t-norms and overlap functions, inflationary BL-algebras were also studied as a recent kind of generalization BL-algebras, which can be obtained general functions. In this paper, we show that not every function induce an BL-algebra counterexample thus propose new concept weak BL-algebras. We prove each corresponds to BL-algebra; there...

In this paper, we introduce the notion of bi-Smarandache BL-algebra, bi-weak Smarandache BL-algebra, bi-Q-Smarandache ideal and bi-Q-Smarandache implicative filter, we obtain some related results and construct quotient of bi-Smarandache BL-algebras via MV-algebras (or briefly bi-Smarandache quotient BL-algebra) and prove some theorems. Finally, the notion of bi-strong Smarandache BL-algebra is ...

The purpose of the present work is to introduce the concept of bifuzzy core of a fuzzy automaton, which induces a bifuzzy topology on the state-set of this fuzzy automaton. This is shown that this bifuzzy topology can be used to characterize the concepts such as bifuzzy family of submachines, bifuzzy separable family and bifuzzy retrievable family of a fuzzy automaton.

In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...

Imai and Iséki [1] introduced the concept of BCK-algebra as a generalization of notions of set difference operation and propositional calculus. The notion of pseudo-BCK algebra was introduced by Georgescu and Iorgulescu [2] as generalization of BCK-algebras not assuming commutativity. Hájek [3] introduced the concept of BL-algebras as the general semantics of basic fuzzy logic (BL-logic). Iorgu...

In this paperwe adapt thewell-knownBrzozowskideterminizationmethod to fuzzy automata. Thismethod gives better results than all previously knownmethods for determinization of fuzzy automata developed by Bělohlávek [InformSciences 143 (2002)205–209],Li andPedrycz [FuzzySet Syst 156 (2005)68–92], Ignjatović et al. [Inform Sciences 178 (2008) 164–180], and Jančić et al. [Inform Sciences 181 (2011) ...

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...

In this paper, at first, we define the notion of general fuzzy automaton over a field; call vector (VGFA). Moreover, present concept max-min automaton. We show that if two VGFA are similar, they constitute an isomorphism. After that, prove isomorphism with threshold α, equivalent where $\alpha \in [0,1]$. Also, some examples given to clarify these new notions.