Equivalence, reduction and minimization of finite automata over semirings
Theoretical Computer Science
Aggregation operators and fuzzy systems modeling
Fuzzy Sets and Systems
Information Sciences: an International Journal
Information Sciences: an International Journal
Remarks on uninorm aggregation operators
Fuzzy Sets and Systems
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Semirings, Automata and Languages
Semirings, Automata and Languages
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
Fuzzy recognizers and recognizable sets
Fuzzy Sets and Systems - Mathematics
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification
Information Sciences: an International Journal
Modeling and control of fuzzy discrete event systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A formal model of computing with words
IEEE Transactions on Fuzzy Systems
Minimization of states in automata theory based on finite lattice-ordered monoids
Information Sciences: an International Journal
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Approximation and robustness of fuzzy finite automata
International Journal of Approximate Reasoning
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
The relationship of controllability between classical and fuzzy discrete-event systems
Information Sciences: an International Journal
Information Sciences: an International Journal
Grammar theory based on lattice-ordered monoid
Fuzzy Sets and Systems
Fault detection and isolation based on fuzzy automata
Information Sciences: an International Journal
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
Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency
Fuzzy Sets and Systems
Weighted finite automata over strong bimonoids
Information Sciences: an International Journal
Fuzzy regular languages over finite and infinite words
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
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
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
A new algorithm for testing diagnosability of fuzzy discrete event systems
Information Sciences: an International Journal
Nondeterministic fuzzy automata
Information Sciences: an International Journal
Algebraic properties of LA-languages
Information Sciences: an International Journal
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Fuzzification of Rational and Recognizable Sets
Fundamenta Informaticae
Lattice-valued finite state machines and lattice-valued transformation semigroups
Fuzzy Sets and Systems
Computation of the greatest simulations and bisimulations between fuzzy automata
Fuzzy Sets and Systems
Factorization of fuzzy automata
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
Algebraic properties of L-fuzzy finite automata
Information Sciences: an International Journal
Fuzzy identities with application to fuzzy semigroups
Information Sciences: an International Journal
Hi-index | 0.21 |
We study fuzzy finite automata in which all fuzzy sets are defined by membership functions whose codomain forms a lattice-ordered monoid L. For these L-fuzzy finite automata (L-FFA, for short), we provide necessary and sufficient conditions for the extendability of the state-transition function. It is shown that nondeterministic L-FFA (NL-FFA, for short) are more powerful than deterministic L-FFA (DL-FFA, for short). Then, we give necessary and sufficient conditions for the simulation of an NL-FFA by an equivalent DL-FFA. Next, we turn to the closure properties of languages defined by L-FFAs: we establish closure under the regular operations and provide conditions for closure under intersection and reversal, in particular we show that the family of fuzzy languages accepted by DL-FFAs is not closed under Kleene closure operation, and the family of fuzzy languages accepted by NL-FFAs is not closed under complement operation. Furthermore, we introduce the notions of L-fuzzy regular expressions and give the Kleene theorem for NL-FFAs. The description of DL-FFAs by L-fuzzy regular expressions is also given. Finally, we investigate the level structures of L-FFAs. Our results provide some insight as to what extend properties of L-FFAs and their languages depend on the algebraic properties of L.