Minimization of fuzzy finite automata
Information Sciences: an International Journal
Finite nondeterministic automata: simulation and minimality
Theoretical Computer Science
Fuzzy Relational Systems: Foundations and Principles
Fuzzy Relational Systems: Foundations and Principles
On quotient machines of a fuzzy automaton and the minimal machine
Fuzzy Sets and Systems
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
Reducing NFAs by invariant equivalences
Theoretical Computer Science
NFA reduction algorithms by means of regular inequalities
Theoretical Computer Science - Developments in language theory
Theoretical Computer Science - Insightful theory
Minimization of states in automata theory based on finite lattice-ordered monoids
Information Sciences: an International Journal
Fuzzy equivalence relations and their equivalence classes
Fuzzy Sets and Systems
Congruences and homomorphisms of fuzzy automata
Fuzzy Sets and Systems
Reducing the size of NFAs by using equivalences and preorders
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Fuzzy relation equations and reduction of fuzzy automata
Journal of Computer and System Sciences
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Weakly linear systems of fuzzy relation inequalities: The heterogeneous case
Fuzzy Sets and Systems
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Hi-index | 0.00 |
We show that the size reduction problem for fuzzy automata is related to the problem of solving a particular system of fuzzy relation equations. This system consists of infinitely many equations, and finding its general solution is a very difficult task, so we first consider one of its special cases, a finite system whose solutions, called right invariant fuzzy equivalences, are common generalizations of recently studied right invariant or well-behaved equivalences on NFAs, and congruences on fuzzy automata. We give a procedure for constructing the greatest right invariant fuzzy equivalence contained in a given fuzzy equivalence, whichwork if the underlying structure of truth values is a locally finite residuated lattice.