.png){kind=icon}
返回
Fuzzy Pushdown Termination Games
.png){kind=icon}
PRE
AI
DOI：10.1109/TFUZZ.2018.2869127.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The computational study on finite/infinite-state systems, probabilistic systems, and finite-state fuzzy systems, has received much attention recently. In contrast, there are very few results for algorithmic analysis of infinite-state fuzzy systems. In this paper, we introduce fuzzy pushdown termination games (FPDTGs), which are an extension of fuzzy pushdown automata with a game feature and can serve as a formal model of infinite-state fuzzy systems. We investigate some computational issues of the games under termination objectives for two players: the goal of player-1 is to maximize the truth value of eventually terminating at some given configurations with the empty stack, while player-2 aims at the opposite. Some interesting results are obtained. For example, we show that both players have optimal memoryless strategies and the same value. The problem of computing the value can be solved in exponential time when the triangular norm is chosen as the minimum one. Furthermore, we present efficient algorithms for computing the values of two special subclasses of FPDTGs. The potential for practical use of our model is demonstrated by a case study on a manufacturing system.
Keyword:
Fuzzy automata
pushdown automata (PDAs)
pushdown game
reachability problem
triangular norm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.9
论文数:
5.0K
被引数:
2.9W
机构
引用论文
.png){kind=icon}
Potential of Metal Complexes for the Treatment of Cancer: Current Update and Future Prospective
PREAI
分享收藏
Automata theory based on complete residuated lattice-valued logic: Pushdown automata基于完全剩余格值逻辑的自动机理论: 下推自动机
PREAI
分享收藏
查看更多内容