助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   pumping引理 的翻译结果: 查询用时:0.014秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

pumping引理
相关语句
  pumping lemma
     PETRI NET DESCRIPTION OF PUMPING LEMMA─A SET OF CONDITIONS FOR DETERMINING THE TYPE OF A PETRI NET LANGUAGE
     Pumping引理的Petri网描述──Petri网语言属型的一组判定条件
短句来源
     The Pumping Lemma of Petri Net Language
     Petri网语言的Pumping引理
短句来源
     The Pumping Lemma of Petri net language reflects some commonness of Petri net language and can be used to prove that some languages is not Petri net language.
     Petri网语言的Pumping引理反映了Petri网语言的共性,可用来证明某些语言不是Petri网语言.
短句来源
     A Petri net language L, which is produced by a bounded Petri net, has been proved to be a regular language. So the Pumping Lemma of regular language is effective to L. But the Pumping Lemma of regular language is not applicable for any Petri net language.
     已经证明,当一个Petri网语言可被某个有界Petri网产生时,此语言是正规语言,因此,正规语言的Pumping引理对此语言是有效的,但正规语言的Pumping引理并不适用于所有的Petri网语言.
短句来源
     This article gives a Pumping Lemma of Petri net language which is proved to be effective to all Petri net languages without empty-label and the Pumping Lemma of regular languages actually is a special format of the Lemma.
     文中给出了一种Petri网语言的Pumping引理,证明其对任意无空标注的Petri网语言都有效,并且正规语言的Pumping引理是此引理的一种特殊形式.
短句来源
  “pumping引理”译为未确定词的双语例句
     A set of necessary and sufficient conditions for determining a Petri net language to be a regular language, context-free language or a context-sensitive language are given in this paper. The determining conditions are obtained by transforming the Pumping Lamma in formal language theory into the structured properties of the standard Petri net corresponding to the given Petri net.
     本文通过Pumping引理在Petri网的变迁节引发序列中的反映,揭示了对应的Petri网结构内涵,从而给出了判定一个标准Petri网产生的语言分别为正规语言或上下文无关语言的充要条件.这样,就可以从网的结构直接判断其语言属型.
短句来源
     By the Lemma, this paper proofs some languages not be produced by any Petri net.
     利用此Pumping引理可以证明某些语言是不能由Petri网产生的.
短句来源
     Based on the former conclusion on the fuzzy context-free language, we simplify further fuzzy context-free grammar, and introduce depicting the properties of fuzzy grammar and language by productions, then obtain an important theorem: Chomsky normal form theorem.
     在关于Fuzzy上下文无关语言的已有成果基础上,进一步考虑简化Fuzzy上下文无关文法,提出用派生刻画Fuzzy上下文无关文法与语言的性质,得到了Fuzzy上下文无关语言的Chomsky定理,并利用Pumping引理来判别一个语言是否为上下文无关语言。
  相似匹配句对
     The Pumping Lemma of Petri Net Language
     Petri网语言的Pumping引理
短句来源
     On the lemma of Schwarz
     关于Schwarz引理
短句来源
     Generalization of Cartan's Lemma
     Cartan引理的推广
短句来源
     By the Lemma, this paper proofs some languages not be produced by any Petri net.
     利用此Pumping引理可以证明某些语言是不能由Petri网产生的.
短句来源
查询“pumping引理”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  pumping lemma
Systems without a universal clock (a pumping lemma is given for this case) proves in general to be weaker than the synchronized systems.
      
Finally we prove that the languages in ? satisfy a suitable 'pumping' lemma and that ? contains languages which are not recursively enumerable.
      
A quantum pumping lemma is employed to show that there are regular languages that are not η-quantum, 0≤η>amp;lt;1.
      
A quantum pumping lemma is employed to showthat there are regular languages that are not η-quantum, 0 ≤ η >amp;lt; 1.
      
We establish the pumping lemma in automata theory based on quantum logicunder certain conditions on implication, and discuss the recognizability by theproduct and union of orthomodular lattice-valued (quantum) automata.
      
更多          


A set of necessary and sufficient conditions for determining a Petri net language to be a regular language, context-free language or a context-sensitive language are given in this paper. The determining conditions are obtained by transforming the Pumping Lamma in formal language theory into the structured properties of the standard Petri net corresponding to the given Petri net.

本文通过Pumping引理在Petri网的变迁节引发序列中的反映,揭示了对应的Petri网结构内涵,从而给出了判定一个标准Petri网产生的语言分别为正规语言或上下文无关语言的充要条件.这样,就可以从网的结构直接判断其语言属型.

Petri net language is both an important component of Petri net theory and a good tool for analyzing behavior of a system. The Pumping Lemma of Petri net language reflects some commonness of Petri net language and can be used to prove that some languages is not Petri net language. A Petri net language L, which is produced by a bounded Petri net, has been proved to be a regular language. So the Pumping Lemma of regular language is effective to L. But the Pumping Lemma of regular language is not applicable for...

Petri net language is both an important component of Petri net theory and a good tool for analyzing behavior of a system. The Pumping Lemma of Petri net language reflects some commonness of Petri net language and can be used to prove that some languages is not Petri net language. A Petri net language L, which is produced by a bounded Petri net, has been proved to be a regular language. So the Pumping Lemma of regular language is effective to L. But the Pumping Lemma of regular language is not applicable for any Petri net language. This article gives a Pumping Lemma of Petri net language which is proved to be effective to all Petri net languages without empty-label and the Pumping Lemma of regular languages actually is a special format of the Lemma. By the Lemma, this paper proofs some languages not be produced by any Petri net.

Petri网语言是Petri网理论的重要组成部分,也是系统行为分析的一种重要的工具.Petri网语言的Pumping引理反映了Petri网语言的共性,可用来证明某些语言不是Petri网语言.已经证明,当一个Petri网语言可被某个有界Petri网产生时,此语言是正规语言,因此,正规语言的Pumping引理对此语言是有效的,但正规语言的Pumping引理并不适用于所有的Petri网语言.文中给出了一种Petri网语言的Pumping引理,证明其对任意无空标注的Petri网语言都有效,并且正规语言的Pumping引理是此引理的一种特殊形式.利用此Pumping引理可以证明某些语言是不能由Petri网产生的.

>=Based on the former conclusion on the fuzzy context-free language, we simplify further fuzzy context-free grammar, and introduce depicting the properties of fuzzy grammar and language by productions, then obtain an important theorem: Chomsky normal form theorem.

在关于Fuzzy上下文无关语言的已有成果基础上,进一步考虑简化Fuzzy上下文无关文法,提出用派生刻画Fuzzy上下文无关文法与语言的性质,得到了Fuzzy上下文无关语言的Chomsky定理,并利用Pumping引理来判别一个语言是否为上下文无关语言。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关pumping引理的内容
在知识搜索中查有关pumping引理的内容
在数字搜索中查有关pumping引理的内容
在概念知识元中查有关pumping引理的内容
在学术趋势中查有关pumping引理的内容
 
 

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