  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
