Abstract
Automata theory based on complete residuated lattice-valued logic, called L- valued finite automata ( L- VFAs), has been established by Qiu recently. In this paper, we define a kind of Mealy type of L- VFAs ( MLFAs), a generalization of L- VFAs. Two kinds of statewise equivalence relations are introduced, and a minimal form is defined. We study the existence of the minimal form of an MLFA. Then, we show that any two states can be distinguished by some word with finite length. Also, a minimization algorithm of the MLFAs is presented. In addition, we obtain a minimization algorithm for L- VFAs as well. Finally, we define L- valued languages ( L- VLs) and L- valued regular languages ( L- VRLs) recognized by L- VFAs, and provide some properties of L- VRLs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
