论文部分内容阅读
给出了一种求解闭能观子语言的算法，该算法经ｍ步（系统中离散事件个数）收敛，并且由它求出的闭可观子语言总包括最大闭可识别子语言．
An algorithm for solving closed-canon sublanguage is given. The algorithm converges in m steps (the number of discrete events in the system), and the closed observable subtree obtained from it always includes the maximum closed recognizable sub-language.