首页> 外文会议>Annual symposium on theoretical aspects of computer science >A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
【24h】

A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages

机译:常规明星语言层次结构的可辨icis的逻辑方法

获取原文

摘要

We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of Higman, and on the Rabin tree theorem. In this way, we get purely logical, short proofs for some known facts on decidability, which might be of methodological interest. Our approach is also applicable to some other similar situations, say to "words" over dense orderings which is relevant to the continuous time and hybrid systems.
机译:我们提出了一种新的,逻辑,探讨了冒斗和Brzozozowski层次结构的可辨赖性问题,基于模型理论的保存定理,在Higman的定理和Rabin树定理上。通过这种方式,我们对脱钩性的一些已知事实获得了纯粹的逻辑,短缺证据,这可能是方法论利益。我们的方法也适用于其他一些类似的情况,例如与连续时间和混合系统相关的密集排序的“单词”。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号