 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   ω-语言 的翻译结果: 查询用时：0.016秒 在分类学科中查询 所有学科 计算机软件及计算机应用 数学 更多类别查询 历史查询  ω-语言  ω-language
 (3)suppose L is the left-inverse-closed ω-language over S,if the index of the ω-Nerode equivalence relation defined by the L is finite,then the L is ω-regular language. (3)设L是∑上的左逆封闭的ω-语言,若L所确定的ω-Nerode等价关系的指数有穷,则L必为ω-正则语言。 短句来源 This paper defined the concept of the ω-Nerode equivalence relation over Σ~ω which is determined by the ω-language over Σ and the concept of left-inverse-closed ω-language. 本文定义了由∑上的ω-语言所确定的∑~∞上的ω-Nerode等价关系的概念以及∑上的ω-语言为左逆封闭的ω-语言的概念。 短句来源 Thus in a class of ω-language with prefix-inverse-related ω-language or left-inverse-closed ω-language, the characteristics of fuzzy ω-regular language is given from algebra and set viewpoints. 因而在由前缀逆相关ω-语言或左逆封闭ω语言组成的ω-语言类中,Fuzzyω正则语言的代数特征就可从代数和集合论的观点给出。 短句来源 Using set method, this paper shows when an ω-language over finit alphabet is applied by left convex substitution, right convex Substitution and convex substitution, the image is ω-left convex language, ω-right convex language and ω-convex language one by one. 本文用集合论的方法给出在有穷字母表∑上的任意ω-语言在左凸置换、右凸置换和凸换下的象依次为ω-左凸语言、ω-右凸语言和ω-凸语言。 短句来源 Over the closed ω-language, the paper also gives the characterization of ω-left convex language, ω-right convex language and ω-Convex language which satisfied some conditions. 本文还给出了在闭的ω-语言类上,ω-左凸语言、ω-右凸语言以及特殊的一类ω-凸语言的特征。 短句来源 更多 ω-languages
 ON REGULARITY OF ω-LANGUAGES 关于ω-语言的正则性 短句来源 To gain insight into how the split game can be applied to attack the long-standing generalized star height 2 problem, we propose and solve the omega power problem, a similar but tractable problem in the context of ω-languages. 为了理解这种游戏如何能被用来攻克著名的困难的star height 2问题，我们提出并且解决了star height 2问题在ω-语言理论中的一个类似的但较为容易驾驭的变种，即omega power问题。 短句来源 “ω-语言”译为未确定词的双语例句
 CHARACTER OF ω REGULAR IN A CLASS OF LANGUAGES 在一类ω-语言中ω-正则的特征 短句来源 查询“ω-语言”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  ω-language
 We show that, for any positive integer n , there exists at least one timed ω -language Ln which is accepted by a 2n -processor real-time algorithm using arbitrarily slow processors, but cannot be accepted by a (2n-1) -processor real-time algorithm. ω-languages
 We investigate the relationship between the classes of ω-languages accepted by Turing machines according to two types of acceptance: 1) Machines of the first type are allowed to read only a finite part of the infinite input. For the case of finite-state and closed ω-languages we exhibit an algorithm for the approximate calculation of the local Hausdorff dimension using the fact that, in this case, the local Hausdorff dimension and the local entropy coincide. This paper links the concepts of Kolmogorov complexity (in complexity theory) and Hausdorff dimension (in fractal geometry) for a class of recursive (computable) ω -languages. The results may help clarify the difference between deterministically and nondeterministically finite state acceptable ω-languages. An ω-language is a set consisting of infinite-strings over some alphabet ∑, the ω-language accepted by some ω-finite state automation is called the ω-regular language.Several sufficient conditions for an ω-language is an ω-regular language are given by author from the point of view of the set in . In this paper, author gives still from the point of view of the set a sufficient condition for an ω-language is an ω-regular language, i.e., if L is an ω-convex language, such that L = Adh(pref(L)) = Pref(L)Tail(L),... An ω-language is a set consisting of infinite-strings over some alphabet ∑, the ω-language accepted by some ω-finite state automation is called the ω-regular language.Several sufficient conditions for an ω-language is an ω-regular language are given by author from the point of view of the set in . In this paper, author gives still from the point of view of the set a sufficient condition for an ω-language is an ω-regular language, i.e., if L is an ω-convex language, such that L = Adh(pref(L)) = Pref(L)Tail(L), then the L is an ω-regular language. Thus defined one subclass of the ω-regular languages class. ω—语言是由有穷字母表∑上的某些无穷串组成的集合。被所谓的ω—有穷自动机接受的ω—语言称为ω—正则语言。在中作者曾从集合的角度给出—ω—语言为ω—正则语言的几个充分条件。在本文作者仍从集合的角度给出一个ω—语言为ω—正则语言的充分条件,即若—ω—凸语言L满足L=adh(pref(L))=pref(L)tail(L),则L是—ω—正则语言。从而,确定了ω—正则语言类的一个子类。 This paper introduces the concept of w-Nerode equivalence relation over ∑w, which is determined by the co-language over finite alphabet ∑, and the concept of prefix-inverse-related w-language over ∑. It is proved that prefix-inverse-related co-language over ∑ is w-regular, language if and only if the index of the w-Nerode equivalence relation defined by the L is finite. Finally, ina class of w-languages such as prefix-inverse-related co-languages over ∑, the characteristics of the w-regular language is given... This paper introduces the concept of w-Nerode equivalence relation over ∑w, which is determined by the co-language over finite alphabet ∑, and the concept of prefix-inverse-related w-language over ∑. It is proved that prefix-inverse-related co-language over ∑ is w-regular, language if and only if the index of the w-Nerode equivalence relation defined by the L is finite. Finally, ina class of w-languages such as prefix-inverse-related co-languages over ∑, the characteristics of the w-regular language is given from algebra and set viewpoints. 为了给出本文的主要结果,首先引进了由有穷字母表∑上的ω~-语言所确定的集合∑~ω上的ω-Nerode等价关系的概念.在此基础上证明了∑上的与前缀逆相关的ω~-语言是ω~-正则语言,当且仅当由它所确定的ω-Nerode等价关系的指数有穷.从而,本文从代数、集合的角度给出了在∑上的与前缀逆相关的一类ω~-语言中,ω~-正则语言的特征. This paper defined the concept of the ω-Nerode equivalence relation over Σ~ω which is determined by the ω-language over Σ and the concept of left-inverse-closed ω-language. On the base,we proved; (l)an ω-regular language can be represented by the union of some equivalence classed of some equivalence relation with finite index,left-invariant over Σ~ω. (2) The index of the ω-Nerode equivalence relation defined by an ω-regular language over Σ is finite. (3)suppose L is the left-inverse-closed ω-language over S,if... This paper defined the concept of the ω-Nerode equivalence relation over Σ~ω which is determined by the ω-language over Σ and the concept of left-inverse-closed ω-language. On the base,we proved; (l)an ω-regular language can be represented by the union of some equivalence classed of some equivalence relation with finite index,left-invariant over Σ~ω. (2) The index of the ω-Nerode equivalence relation defined by an ω-regular language over Σ is finite. (3)suppose L is the left-inverse-closed ω-language over S,if the index of the ω-Nerode equivalence relation defined by the L is finite,then the L is ω-regular language. Thus in a class ω-language with left-inverse-closed, the character of the ω-regular language is given from algebra and set viewpoint in this paper. 本文定义了由∑上的ω-语言所确定的∑~∞上的ω-Nerode等价关系的概念以及∑上的ω-语言为左逆封闭的ω-语言的概念。在此基础上证明了:(1)∑上的ω-正则语言必可表示为∑~∞上的某个具有有穷指数的、左不变的等价关系的某些等价类之并。(2)∑上的ω-正则语言所确定的ω-Nerode等价关系的指数必有穷。(3)设L是∑上的左逆封闭的ω-语言,若L所确定的ω-Nerode等价关系的指数有穷,则L必为ω-正则语言。从而,本文从代数、集合的角度给出了在∑上左逆封闭的一类ω-语言中,ω-正则语言的特征。 << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关ω-语言的内容 在知识搜索中查有关ω-语言的内容 在数字搜索中查有关ω-语言的内容 在概念知识元中查有关ω-语言的内容 在学术趋势中查有关ω-语言的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社