DeepAI AI Chat
Log In Sign Up

On Typical Hesitant Fuzzy Languages and Automata

by   Valdigleis S. Costa, et al.

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


page 1

page 2

page 3

page 4


Nondeterministic fuzzy automata

Fuzzy automata have long been accepted as a generalization of nondetermi...

A Fuzzy Petri Nets Model for Computing With Words

Motivated by Zadeh's paradigm of computing with words rather than number...

MK-fuzzy Automata and MSO Logics

We introduce MK-fuzzy automata over a bimonoid K which is related to the...

Bisimulations for fuzzy transition systems

There has been a long history of using fuzzy language equivalence to com...

Performance Evaluation of Road Traffic Control Using a Fuzzy Cellular Model

In this paper a method is proposed for performance evaluation of road tr...

Fuzzy Jets

Collimated streams of particles produced in high energy physics experime...

Algorithms for computing the greatest simulations and bisimulations between fuzzy automata

Recently, two types of simulations (forward and backward simulations) an...