Fuzzy Finite Tree Automata (FFTA) are natural generalizations of fuzzy automata on words. FFTA accept fuzzy tree languages and are used in many areas of mathematics, computer science and engineering. Therefore, it is important to design algorithms that reduce the size (number of states) of automata, and find the minimal FFTA that recognizes the same language as a given FFTA. We present two mini...

Abstract Fuzzy multiset finite automata with output represent fuzzy version of (with output) working over multisets. This paper introduces Mealy-like, Moore-like, and compact automata. Their mutual transformations are described to prove their equivalent behaviours. Furthermore, various variants reduced studied where the reductions directed decrease number components (like initial distribution, ...

The quotient operator plays an important role for query evaluation in relational databases. Its extension to fuzzy databases raises the question of the intended interpretation of the intermediary degrees attached to the items in the fuzzy relations. This note points out that the fuzzy quotient operator should be defined in slightly different ways depending on the possible interpretations of the...

We propose a new class of algebraic structure named as (m, n)-semihyperring which is a generalization of usual semihyperring. We define the basic properties of (m, n)-semihyperring like identity elements, weak distributive (m, n)semihyperring, zero sum free, additively idempotent, hyperideals, homomorphism, inclusion homomorphism, congruence relation, quotient (m, n)-semihyperring etc. We propo...

This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into account recent results in the scope of algebraic semantics for fuzzy logics over chains with a monoidal residuated operation, we advocate linearly ordered BL-algebras and MTL-algebras as adequate generalizations of continu...

In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...

In this paper, we introduce the concept of fuzzy congruences on n-ary semigroups and describe quotient n-ary semigroups by fuzzy congruences. Some isomorphism theorems about n-ary semigroups are established. Moreover, we discuss a special kind of n-ary semigroups. We also establish relationships between normal fuzzy ideals and fuzzy congruences. In particular, we prove that there exists a prese...

In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introd...