The aim of this paper is to introduce the notion of (∈,∈∨ q)-fuzzy (implicative, MV and G-) filters of pseudo-BL algebras and to investigate some of their related properties. Some characterization theorems of these generalized fuzzy (implicative) filters are derived. The relationship among these generalized fuzzy filters of pseudo-BL algebras is considered. It is proved that an (∈,∈∨ q)fuzzy fi...

The paper studies the relationship among fuzzy context free languages and fuzzy push down automata. The degree of membership of the words to the fuzzy language generated by a context free grammar, calculated in a monoid, introduces an additional burden for the accepting push down weighted automaton. Even in the case of languages accepted by fuzzy deterministic push down automata, the relationsh...

The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...

A t-norm is a binary operation on [0, 1] that is associative, commutative, with identity 1 and non-decreasing in both argument. The notion of t-norm is very important in the context of fuzzy logic, for it is used in modeling a general form of the propositional conjunction. The basic fuzzy logic (BL logic) was introduced by Hájek in [9,10] and it was inspired by a continuous t-norm and its resid...

We introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. By using this new idea, we introduce the notions of interval valued (∈,∈ ∨ q)-fuzzy filters of pseudo BL-algebras and investigate some of their related properties. Some characterization theorems of these generalized interval valued fuzzy filters are derived. The relationship among these ge...

In this paper we combine determinization and state reduction methods into two-in-one algorithms that simultaneously perform determinization and state reduction. These algorithms perform better than all previous determinization algorithms for fuzzy finite automata, developed by Bělohlávek [Inform Sciences 143 (2002) 205–209], Li and Pedrycz [Fuzzy Set Syst 156 (2005) 68–92], Ignjatović et al. [I...

Finite state automata are crucial for numerous practical algorithms of computer science. We show how to use genetic algorithms and fuzzy automata to simplify a class of FSA defined by labeled graphs and considered in the literature. Finite state automata, FSA, are well-known tools used in coding theory, text processing, image analysis and compression, speech recognition, and bioinformatics. Lab...

in this paper, a numerical method for nding minimal solution of a mn fullyfuzzy linear system of the form ax = b based on pseudo inverse calculation,is given when the central matrix of coecients is row full rank or column fullrank, and where a~ is a non-negative fuzzy mn matrix, the unknown vectorx is a vector consisting of n non-negative fuzzy numbers and the constant b isa vector consisti...

in the last decade, cellular automata models have been widely used for simulation spatial phenomena; however, exact nature of these models have been lead to various limitations for essential simulation of these phenomena. in this research, traditional cellular automata models have been developed through fuzzy theory, in which, transition rules are expressed based on fuzzy logic control methodol...

To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...