Autômatos fuzzy hesitantes típicos: teoria e aplicações

Abstract

The fuzzy automata are a generalization of finite automata, which can model computation with uncertainty. Due to the fuzzy sets extensions, different generalizations of fuzzy automata such as interval-valued fuzzy automata and intuitionist fuzzy automata have been presented. Fuzzy automata are a fundamental part of the fuzzy computation theory. Moreover, they also have success in practical applications, mainly in pattern recognition. This work introduces a new generalization of fuzzy automata based on the definitions of typical hesitant fuzzy sets. The central idea behind this generalization is to bring to the field of computing the possibility of working simultaneously with uncertainty and hesitation. Thus, this new generalization aims to enable new ways to face problems that were not easily modeled before used only uncertainties. Besides, this work shows ways to apply these new automata in classification problems and image processing.