Information Sciences: an International Journal
Information Sciences: an International Journal
Handbook of formal languages, vol. 1
Finiteness and Regularity in Semigroups and Formal Languages
Finiteness and Regularity in Semigroups and Formal Languages
Fuzzy Relational Systems: Foundations and Principles
Fuzzy Relational Systems: Foundations and Principles
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
Fuzzy Semigroups
Regular grammars with truth values in lattice-ordered monoid and their languages
Soft Computing - A Fusion of Foundations, Methodologies and Applications
The equivalence between fuzzy Mealy and fuzzy Moore machines
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Minimization of states in automata theory based on finite lattice-ordered monoids
Information Sciences: an International Journal
Artificial Intelligence
Fuzzy equivalence relations and their equivalence classes
Fuzzy Sets and Systems
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
Weighted automata and weighted logics
Theoretical Computer Science
Approximation and robustness of fuzzy finite automata
International Journal of Approximate Reasoning
Congruences and homomorphisms of fuzzy automata
Fuzzy Sets and Systems
A categorical approach to lattice-valued fuzzy automata
Fuzzy Sets and Systems
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algebraic properties of LA-languages
Information Sciences: an International Journal
The relationships among several types of fuzzy automata
Information Sciences: an International Journal
Modeling and control of fuzzy discrete event systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Supervisory control of fuzzy discrete event systems: a formal approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Computing with words via Turing machines: a formal approach
IEEE Transactions on Fuzzy Systems
Factorization of fuzzy automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Grammar theory based on lattice-ordered monoid
Fuzzy Sets and Systems
Fuzzy homomorphisms of algebras
Fuzzy Sets and Systems
Approximation of fuzzy context-free grammars
Information Sciences: an International Journal
Intuitionistic fuzzy transformation semigroups
Information Sciences: an International Journal
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
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
Determinization of weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Information Sciences: an International Journal
Finite automata theory with membership values in lattices
Information Sciences: an International Journal
An improved algorithm for determinization of weighted and fuzzy automata
Information Sciences: an International Journal
Determination of α-resolution in lattice-valued first-order logic LF(X)
Information Sciences: an International Journal
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Construction of fuzzy automata from fuzzy regular expressions
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
Algebraic properties of L-fuzzy finite automata
Information Sciences: an International Journal
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
Hi-index | 0.07 |
In this paper we introduce a new method for determinization of fuzzy finite automata with membership values in complete residuated lattices. In comparison with the previous methods, developed by Belohlavek [R. Belohlavek, Determinism and fuzzy automata, Information Sciences 143 (2002), 205-209] and Li and Pedrycz [Y.M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005), 68-92], our method always gives a smaller automaton, and in some cases, when the previous methods result in infinite automata, our method can result in a finite one. We also show that determinization of fuzzy automata is closely related to fuzzy right congruences on a free monoid and fuzzy automata associated with them, and in particular, to the concept of the Nerode's fuzzy right congruence of a fuzzy automaton, which we introduce and study here.