Polynomial crisp-minimization algorithm for fuzzy deterministic automata
Designing automata minimization algorithms is a significant topic in Automata Theory and Languages with practical applications. In this paper, we develop an efficient minimization algorithm for deterministic fuzzy finite automata over locally finite lattices. More precisely, the algorithm outputs an...
Saved in:
| Published in: | Fuzzy sets and systems Vol. 495-496; p. 109108 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.11.2024
|
| Subjects: | |
| ISSN: | 0165-0114 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!