收藏本站
收藏 | 手机打开
二维码
手机客户端打开本文

Minimization of L-valued Finite Sequential Machine

【摘要】:正We take a finite lattice-ordered monoid as the truth-value domain for fuzzy finite sequential ma- chines in this paper.The notion of L-valued finite sequential machines(L-FSMs,for short)occurring in [1]is modified,and some related properties are also discussed.Moreover,we formulate the definition of behavior mapping to determine the operation of an L-FSM,and give an algorithm to compute the image of the behavior mapping for a given L-FSM.Finally, its statewise equivalence relations are defined,based on which we present a minimization algorithm for an L-FSM.

知网文化
 快捷付款方式  订购知网充值卡  订购热线  帮助中心
  • 400-819-9993
  • 010-62982499
  • 010-62783978