DeepAI AI Chat
Log In Sign Up

Nondeterministic fuzzy automata

by   Yongzhi Cao, et al.

Fuzzy automata have long been accepted as a generalization of nondeterministic finite automata. A closer examination, however, shows that the fundamental property---nondeterminism---in nondeterministic finite automata has not been well embodied in the generalization. In this paper, we introduce nondeterministic fuzzy automata with or without -moves and fuzzy languages recognized by them. Furthermore, we prove that (deterministic) fuzzy automata, nondeterministic fuzzy automata, and nondeterministic fuzzy automata with -moves are all equivalent in the sense that they recognize the same class of fuzzy languages.


page 1

page 2

page 3

page 4


MK-fuzzy Automata and MSO Logics

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

On Typical Hesitant Fuzzy Languages and Automata

The idea of nondeterministic typical hesitant fuzzy automata is a genera...

Bisimulations for fuzzy automata

Bisimulations have been widely used in many areas of computer science to...

Algorithms for computing the greatest simulations and bisimulations between fuzzy automata

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

A Fuzzy Petri Nets Model for Computing With Words

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

Reduction of fuzzy automata by means of fuzzy quasi-orders

In our recent paper we have established close relationships between stat...