Semirings, automata, languages
Semirings, automata, languages
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Automata theory based on quantum logic: some characterizations
Information and Computation
A theory of computation based on quantum logic (I)
Theoretical Computer Science
Weighted automata and weighted logics
Theoretical Computer Science
Automata theory based on quantum logic: Reversibilities and pushdown automata
Theoretical Computer Science
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Finite automata and their decision problems
IBM Journal of Research and Development
Fuzzy regular languages over finite and infinite words
Fuzzy Sets and Systems
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Algebraic properties of LA-languages
Information Sciences: an International Journal
The relationships among several types of fuzzy automata
Information Sciences: an International Journal
Parameter Identification of Recurrent Fuzzy Systems With Fuzzy Finite-State Automata Representation
IEEE Transactions on Fuzzy Systems
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Information Sciences: an International Journal
Nondeterministic fuzzy automata
Information Sciences: an International Journal
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Rough set theory applied to lattice theory
Information Sciences: an International Journal
Lattice-valued finite state machines and lattice-valued transformation semigroups
Fuzzy Sets and Systems
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
| Hi-index | 0.08 |
In this paper, we study finite automata with membership values in a lattice, which are called lattice-valued finite automata. The extended subset construction of lattice-valued finite automata is introduced, then the equivalences between lattice-valued finite automata, lattice-valued deterministic finite automata and lattice-valued finite automata with @e-moves are proved. A simple characterization of lattice-valued languages recognized by lattice-valued finite automata is given, then it is proved that the Kleene theorem holds in the frame of lattice-setting. A minimization algorithm of lattice-valued deterministic finite automata is presented. In particular, the role of the distributive law for the truth valued domain of finite automata is analyzed: the distributive law is not necessary to many constructions of lattice-valued finite automata, but it indeed provides some convenience in simply processing lattice-valued finite automata.