We consider the problem of finding the mask value of the supremal normal sublanguage L/sub R/ of some given language L. We describe a straightforward algorithmic solution that can be applied to existing off-line procedures for determining the supremal controllable and normal sublanguage of L and that does not require an explicit calculation of L/sub R/. This problem is fundamental because it is related to the supervisory control problem under partial observation. Our algorithm applies only to closed languages.
展开▼
机译：我们考虑了寻找某种给定语言L的最高正常子语言L / sub R /的掩码值的问题。我们描述了一种简单的算法解决方案，该算法可应用于现有的离线过程中，以确定最高的可控制和正常的子语言。 L并且不需要显式计算L / sub R /。这个问题是根本的，因为它与部分观察下的监督控制问题有关。我们的算法仅适用于封闭式语言。
展开▼
