.png){kind=icon}
返回
Polynomial crisp-minimization algorithm for fuzzy deterministic automata ☆
.png){kind=icon}
PRE
AI
DOI：10.1016/j.fss.2024.109108.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 equivalent minimal crisp-deterministic fuzzy finite automaton for an input fuzzy deterministic finite automaton (FDfA). The running time of the proposed algorithm is polynomial for particular types of locally finite lattices, specifically for max-min-based complete residuated lattices. The intuition behind the proposed algorithm relies on the polynomial minimization algorithm's intuition for ordinary deterministic automata developed by Vazquez de Parga, Garcia, and Lopez (2013) [35]. The motivation for this study comes from the fact that the original algorithm's notions and meanings are lost in the context of fuzzy automata. Thus, we establish a new theoretical foundation that provides the correctness and the polynomial-time nature of this new crisp-minimization algorithm for FDfAs.
Keyword:
Deterministic fuzzy automaton
Minimization algorithm
Fuzzy & aacute
tomaton
Brzozowski's algorithm
Locally finite lattices
期刊
IF:
2.7
论文数:
7.6K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures
PREAI
分享收藏
Automata theory based on complete residuated lattice-valued logic: Reduction and minimization基于完全剩余格值逻辑的自动机理论: 约简和最小化
PREAI
分享收藏
查看更多内容