𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimization of finite automata

✍ Scribed by A. A. Letichevskii

Publisher
Springer US
Year
1965
Tongue
English
Weight
268 KB
Volume
1
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimization algorithm of fuzzy finite a
Minimization algorithm of fuzzy finite automata
✍ Wei Cheng; Zhi-Wen Mo πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 232 KB

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 ΓΏn

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