An Algorithm Computing Observable Sublanguage
一种求可观子语言的算法

In this paper, an algorithm for computing the closed observable sublanguages isgiven. This algorithm converges within m steps (the number of discrete events in system). In addition, the closed observable sublanguages obtained from the algorithmalways contains the maximal closed normal sublanguage.