Equivalence, reduction and minimization of finite automata over semirings
Theoretical Computer Science
Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
Information Sciences: an International Journal
Information Sciences: an International Journal
Minimization of fuzzy finite automata
Information Sciences: an International Journal
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Finite automata and their decision problems
IBM Journal of Research and Development
Supervisory control of fuzzy discrete event systems: a formal approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Information Sciences: an International Journal
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
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
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
Characterizations of complete residuated lattice-valued finite tree automata
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
Hi-index | 0.21 |
Automata theory based on complete residuated lattice-valued logic, called L-valued finite automata (abbr. L-VFAs), was introduced by the second author in 2001. In this paper we deal with the problems of equivalence between L-valued sequential machines (abbr. L-VSMs) and L-VFAs. We define L-VSMs, and particularly present a method for deciding the equivalence between L-VSMs as well. An algorithm procedure for deciding the equivalence between L-VSMs is constructed. We analyze the complexity and efficiency of the algorithm procedure and obtain the relative results to L-VFAs. Moreover, the definitions of L-valued languages (abbr. L-VLs), and L-valued regular languages (abbr. L-VRLs) recognized by L-VFAs are given, and some related properties are also discussed. We show an equivalent relation between L-VRLs and conventional regular languages. By using L-valued pumping lemma, we get a necessary and sufficient condition for an L-VL to be nonconstant.