助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   monadic second order logic 的翻译结果: 查询用时:0.191秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

monadic second order logic
相关语句
  “monadic second order logic”译为未确定词的双语例句
     This article covers expressive power of modal logic and μ-calculus,and their game semantics. We also give game semantics of first order logic and monadic second order logic,then we use bisimulation as a core concept to relate these logic-
     本文首先讨论了模态逻辑与μ算子的表达能力、博弈语义,给出一阶逻辑与Monadic二阶逻辑的博弈形式,然后讨论互模拟等价在这些逻辑表达能力的核心作用和这些逻辑之间的关系。
短句来源
  相似匹配句对
     Second,
     二是对于?
短句来源
     The second;
     第二,专业设置随波逐流;
短句来源
     The second is its physiological function.
     2.嬉戏行为的生理功能。
短句来源
     Monadic Polynomial Ring Of Domain
     整环上的一元多项式环
短句来源
     On Order
     秩序微言
短句来源
查询“monadic second order logic”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  monadic second order logic
The clique-width of graphs is a major new concept with respect to the efficiency of graph algorithms; it is known that every problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(τ1,L) by Courcelle et al.
      
The expression of graph properties and graph transformations in monadic second-order logic.
      
The CDL formalism is based on the Monadic Second-order Logic on nite binary trees.
      
Moreover, we show that the identified class of synchronisation trees is definable in a monadic second order logic over infinite trees.
      
Monadic second-order logic, graph coverings and unfoldings of transition systems.
      
更多          


A two dimensional grid grammar was designed to fill up the missing ring in the Equivalence Theorem for recognizable picture languages (REC), summarized in a survey paper by Giammarresi and Restivo. Instead of 2 dimensional on line tessellation automata, grid automata were introduced, which were closer to the traditional binary tree automata, to bridge the grid grammar and other approaches of describing the class of REC. Meanwhile the standard (existential) monadic second order logic was substituted...

A two dimensional grid grammar was designed to fill up the missing ring in the Equivalence Theorem for recognizable picture languages (REC), summarized in a survey paper by Giammarresi and Restivo. Instead of 2 dimensional on line tessellation automata, grid automata were introduced, which were closer to the traditional binary tree automata, to bridge the grid grammar and other approaches of describing the class of REC. Meanwhile the standard (existential) monadic second order logic was substituted by a weaker logic framework: positive monadic partition logic. A new and complete version of Equivalence Theorem for REC is presented.

Giammarresi与 Restivo在一篇综述中总结出一个关于可识别的图像语言 (即 2维矩形语言 ) REC的等价性定理 .对比 1维字语言的相应结果 ,其中还缺少关于生成文法的相应一环 .提出了一种 (矩形的 )格点文法 ,正好弥补了这一缺环 .而取代 2维 on- line tesselation自动机 ,引入了格点自动机的概念 .一方面 ,它与经典的 2元树型自动机更相似 ,另一方面 ,它也是格点文法与等价性定理中关于 REC的其他描述方式之间的一座桥梁 .同时 ,标准的 existential monadic二阶逻辑也被一种更弱的规范框架—— positive monadic分划逻辑所取代 .由此导出一个新的更完整的关于 REC的等价性定理

This article covers certain automata, recognizative power of automata, expressive power of logic, and their relation with games. It applies these results to prove the decidability of certain related monadic second-order logic(S1S and S2S). It considers two cases of linear and branching time. These logics are equivalent to some temporal logics on expressive power, and are also very useful in proving decidability of other temporal logic. With decidability some automata can be...

This article covers certain automata, recognizative power of automata, expressive power of logic, and their relation with games. It applies these results to prove the decidability of certain related monadic second-order logic(S1S and S2S). It considers two cases of linear and branching time. These logics are equivalent to some temporal logics on expressive power, and are also very useful in proving decidability of other temporal logic. With decidability some automata can be designed to solve model checking problem.

讨论了特定的自动机、自动机的识别能力、逻辑的表达能力和博弈思想的关系。使用博弈思想可以比较容易地证明一元二阶逻辑(S1S和S2S)的可决定性。主要考虑线性时间(linear time)与分支时间(branch time)两种情况,通过这些逻辑与别的时态逻辑的表达能力的等价性可以证明其它逻辑也具有决定性,可以设计相应的自动机去解决模型检查(Model Checking)问题。

This article covers expressive power of modal logic and μ-calculus,and their game semantics. We also give game semantics of first order logic and monadic second order logic,then we use bisimulation as a core concept to relate these logic-

本文首先讨论了模态逻辑与μ算子的表达能力、博弈语义,给出一阶逻辑与Monadic二阶逻辑的博弈形式,然后讨论互模拟等价在这些逻辑表达能力的核心作用和这些逻辑之间的关系。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关monadic second order logic的内容
在知识搜索中查有关monadic second order logic的内容
在数字搜索中查有关monadic second order logic的内容
在概念知识元中查有关monadic second order logic的内容
在学术趋势中查有关monadic second order logic的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社