We study the structure of partially ordered monoids generated by certain operators on families of fuzzy languages. These operators are induced by simple, well-known operations on fuzzy languages, like fuzzy homomorphism, fuzzy finite substitution and intersection with regular fuzzy languages. The structure of these monoids provides better insight in the (in)dependency of closure properties of s...

We study operations on fuzzy languages such as union, concatenation, Kleene ⋆, intersection with regular fuzzy languages, and several kinds of (iterated) fuzzy substitution. Then we consider families of fuzzy languages, closed under a fixed collection of these operations, which results in the concept of full Abstract Family of Fuzzy Languages or full AFFL. This algebraic structure is the fuzzy ...

there are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. the first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. t...

Intuitionistic fuzzy probabilities are an extension of the concept of probabilities with application in several practical problem solving tasks. The former are probabilities represented through intuitionistic fuzzy numbers, to indicate the uncertainty of the membership and nonmembership degrees in the value assigned to probabilities. Moreover, a dual hesitant fuzzy set (DHFS) is an extension of...

Automata theory plays a key role in computational theory as many computational problems can be solved with its help. Formal grammar is a special type of automata designed for linguistic purposes. Formal grammar generates formal languages. Rough grammar and rough languages were introduced to incorporate the imprecision of real languages in formal languages. These languages have limitations on un...

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...

In this paper, we investigate the multiple attribute decision making (MADM) problem based on the arithmetic and geometric aggregation operators with interval-valued dual hesitant fuzzy linguistic information. Then, motivated by the ideal of traditional arithmetic operation, we have developed some aggregation operators for aggregating interval-valued dual hesitant fuzzy linguistic information: i...

Berstel and Pin have characterized local languages by introducing local automaton. In this paper fuzzy local language is introduced and the fuzzy local languages recognized by partial fuzzy local automata in max-min and min-max compositions are studied. Some closure properties of fuzzy local languages are provided. Mathematics Subject Classification: 68Q45

In this paper, we investigate the multiple attribute decision making (MADM) problem based on the arithmetic and geometric aggregation operators with hesitant fuzzy linguistic information. Then, motivated by the idea of traditional arithmetic operation, we have developed some aggregation operators for aggregating hesitant fuzzy linguistic information: hesitant fuzzy linguistic weighted average (...

Expression and processing of vagueness, which has many real world applications, is not handled effectively in the conventional relational model. In this paper we investigate a fuzzy extension to the relational data model and propose three fuzzy relational query languages. ‘ho of them are the Level-l Fuzzy Relational Algebra and Level-l Fmzy Relational Calculus. They are fundamental query langua...