On Typical Hesitant Fuzzy Languages and Automata
Formal Languages and Automata Theory
2021-02-19 v1 Computation and Language
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
Keywords
Cite
@article{arxiv.2102.09347,
title = {On Typical Hesitant Fuzzy Languages and Automata},
author = {Valdigleis S. Costa and Benjamín C. Bedregal and Regivan H. N. Santiago},
journal= {arXiv preprint arXiv:2102.09347},
year = {2021}
}