首页> 外文会议>Algebraic informatics >On Several Proofs of the Recognizability Theorem
【24h】

On Several Proofs of the Recognizability Theorem

机译:关于可识别性定理的若干证明

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

摘要

The lecture has presented and compared several proofs of the fundamental Recognizability Theorem that relates the Monadic Second-order definability of a set of finite graphs or relational structures and its Recognizability, this notion being denned in terms of finite congruences and not in terms of automata.
机译:讲座介绍并比较了一些基本的可识别性定理的证明,这些定理与一组有限图或关系结构的Monadic二阶可定义性及其可识别性有关,该概念是根据有限同余而不是自动机来定义的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号