Semantic analysis of inductive reasoning
Theoretical Computer Science
On subsystems of a fuzzy finite state machine
Fuzzy Sets and Systems
Products of fuzzy finite state machines
Fuzzy Sets and Systems
Remarks on uninorm aggregation operators
Fuzzy Sets and Systems
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
Structure of upper and lower approximation spaces of infinite sets
Data mining, rough sets and granular computing
Minimization of states in automata theory based on finite lattice-ordered monoids
Information Sciences: an International Journal
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Information Sciences: an International Journal
Intuitionistic fuzzy transformation semigroups
Information Sciences: an International Journal
Diagnosability of fuzzy discrete-event systems: a fuzzy approach
IEEE Transactions on Fuzzy Systems
Pattern recognition using temporal fuzzy automata
Fuzzy Sets and Systems
On a decomposition of fuzzy automata
Fuzzy Sets and Systems
Algebraic properties of LA-languages
Information Sciences: an International Journal
The relationships among several types of fuzzy automata
Information Sciences: an International Journal
Hi-index | 0.07 |
Fuzzy automata theory on lattice-ordered monoids was introduced by Li and Pedrycz. Dropping the distributive laws, fuzzy finite automata (L-FFAs for short) based on a more generalized structure L, named a po-monoid, are presented and investigated from the view of algebra in this paper. The notions of (strong) successor and source operators, fuzzy successor and source operators which are shown to be closure operators on certain conditions are introduced and discussed in detail. Using the weak primary submachines, a unique decomposition theorem of a fuzzy finite automaton based on a lattice-ordered monoid is obtained. Taking L as a quantale, fuzzy subsystems are proved to be the same as fuzzy submachines of an L-FFA. In particular, intrinsic connections between algebraic properties of L and properties of some operators of an L-FFA are discovered. It is shown that the join-preserving property of fuzzy successor and source operators can be fully characterized by the right and left distributive laws respectively, and the idempotence of successor operator can be characterized equivalently by the nonexistence of zero divisors when L is a lattice-ordered monoid.