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.

中文翻译：

---

典型犹豫模糊语言与自动机

非确定性典型犹豫模糊自动机的思想是Costa和Bedregal提出的模糊自动机的推广。本文提出了由非确定性典型犹豫模糊自动机计算典型犹豫模糊语言的充分必要条件。此外，本文还介绍了一个具有清晰过渡的典型犹豫模糊自动机的新类，我们将证明这个新类与 Costa 和 Bedregal 引入的原始类等效。