...
首页> 外文期刊>IEEE Transactions on Automatic Control >An algorithm for computing the mask value of the supremal normalsublanguage of a legal language
【24h】

An algorithm for computing the mask value of the supremal normalsublanguage of a legal language

机译:一种用于计算法律语言的最高正常子语言的掩码值的算法

获取原文
获取原文并翻译 | 示例
           

摘要

We consider the problem of finding the mask value of the supremal normal sublanguage LR 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 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的至上正常子语言LR的掩码值的问题。我们描述了一种简单的算法解决方案,该算法可应用于确定L的至上可控和正常子语言的现有脱机过程,并且这个问题是根本的,因为它与部分观察下的监督控制问题有关。我们的算法仅适用于封闭式语言

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号