# On Typical Hesitant Fuzzy Languages and Automata

arXiv: https://arxiv.org/abs/2102.09347 · HTML: https://mlsanity.com/paper/2102.09347/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 46 references that are in the map.
- First posted on arXiv 18 Feb 2021.

## Abstract (arXiv)

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
