On Typical Hesitant Fuzzy Languages and Automata
This work addresses theoretical foundations in fuzzy automata theory, likely for researchers in computational linguistics or formal languages, and appears incremental as it builds on prior work by Costa and Bedregal.
The paper tackles the problem of characterizing which typical hesitant fuzzy languages can be computed by nondeterministic typical hesitant fuzzy automata, providing sufficient and necessary conditions, and introduces a new class of automata with crisp transitions, showing it is equivalent to the original class.
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