首页> 外文会议>Annual symposium on theoretical aspects of computer science >Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
【24h】

Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra

机译:Myhill-nerode关于自动系统的关系和Kleene代数的完整性

获取原文

摘要

It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use this fact to solve certain infinite systems of inequalities over a Kleene algebra. Automatic systems are a special class of infinite systems that can be viewed as infinite-state automata. Automatic systems can be collapsed using Myhill-Nerode relations in much the same way that finite automata can. The Brzozowski derivative on an algebra of polynomials over a Kleene algebra gives rise to a triangular automatic system that can be solved using these methods. This provides an alternative method for proving the completeness of Kleene algebra.
机译:众所周知,在Kleene代数上再次形成了一个细胞矩阵。对于合适限制的无限矩阵,这也是如此。人们可以使用这一事实来解决Kleene代数上的某些不平等系统。自动系统是一类特殊的无限系统,可以被视为无限状态自动机。可以使用MyHill-Nerode关系折叠自动系统,这与有限自动机会可以相同。在Kleene代数上的多项式的代数上的Brzozowski衍生物产生了一种可以使用这些方法解决的三角自动系统。这提供了一种替代方法,用于证明Kleene代数的完整性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号