Equivalence, reduction and minimization of finite automata over semirings
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Information Sciences: an International Journal
Grammar theory based on lattice-ordered monoid
Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: A categorical approach
Fuzzy Sets and Systems
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
A new algorithm for testing diagnosability of fuzzy discrete event systems
Information Sciences: an International Journal
| Hi-index | 0.20 |
Some uniform categorical theoretical treatment of automata and lattice-valued fuzzy automata using quantale theory is studied in this paper. First, L-relational sheaves on a monoid M and Q-enriched categories are introduced for quantales L and Q, the equivalence of the corresponding categories are proved next. Then lattice-valued (fuzzy) automata are described by Q-enriched categories. In fact, lattice-valued (fuzzy) automata are characterized by the category of generalized lattice-valued automata using the notions of Q-bimodules. Finally, some of the algebraic properties of behaviors of generalized lattice-valued automata are studied by using the technique of gluing of Q-bimodules.