On Typical Hesitant Fuzzy Languages and Automata
Valdigleis S. Costa, Benjam\'in C. Bedregal, Regivan H. N. Santiago
TL;DR
This paper explores the theoretical foundations of typical hesitant fuzzy automata, establishing conditions for language recognition and introducing a new automata class with equivalent computational power.
Contribution
It provides necessary and sufficient conditions for language recognition and introduces a new class of automata with crisp transitions, showing their equivalence to existing models.
Findings
Established conditions for language recognition by nondeterministic automata
Introduced a new class of automata with crisp transitions
Proved the equivalence of the new class to existing models
Abstract
The idea of nondeterministic typical hesitant fuzzy automata is a generalization of the fuzzy automata presented by Costa and Bedregal. This paper, presents the sufficient and necessary conditions for a typical hesitant fuzzy language to be computed by nondeterministic typical hesitant fuzzy automata. Besides, the paper introduces a new class of Typical Hesitant Fuzzy Automata with crisp transitions, and we will show that this new class is equivalent to the original class introduced by Costa and Bedregal
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Natural Language Processing Techniques