Abstract
In this paper, we study a new generalization for the notion of fuzzy automata, which we called typical hesitant fuzzy automata. First, we present the formulations of the mathematics framework for the theory of typical hesitant fuzzy automata. Second, we then show a method to transform nondeterministic typical hesitant fuzzy automata (in short nthfa) into deterministic typical hesitant fuzzy automata (in short dthfa), which is effective at removing nondeterminism but does not preserve faithfully the associated typical hesitant fuzzy language. Moreover, we show that the power of any nthfa is equivalent to a finite family of fuzzy automata.
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.
