𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimization algorithm of fuzzy finite automata

✍ Scribed by Wei Cheng; Zhi-Wen Mo

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
232 KB
Volume
141
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a class of fuzzy ΓΏnite automata corresponding to the Mealy type of ordinary automata is formulated, and also two types of statewise equivalence relations are introduced. From the equivalence relations, a minimal form is deΓΏned and a minimization algorithm of the Mealy type of fuzzy ΓΏnite automata is obtained.

πŸ“œ SIMILAR VOLUMES

Characterizations of fuzzy finite automa
Characterizations of fuzzy finite automata
✍ Daowen Qiu πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 363 KB

In this paper, we establish some important concepts in fuzzy ΓΏnite automata (FFAs) with bifuzzy property, and clarify their essential relationships. First we present a number of basic deΓΏnitions and properties in FFAs. We then deΓΏne a bifuzzy family of subautomata, bifuzzy source and successor opera

Finite nondeterministic automata: Simula
Finite nondeterministic automata: Simulation and minimality
✍ Cristian S. Calude; Elena Calude; Bakhadyr Khoussainov πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 159 KB

Motivated by recent applications of ΓΏnite automata to theoretical physics, we study the minimization problem for nondeterministic automata (with outputs, but no initial states). We use Ehrenfeucht-Fra sse-like games to model automata responses and simulations. The minimal automaton is constructed an