助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   state graph 的翻译结果: 查询用时:0.011秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
电信技术
数学
自动化技术
互联网技术
计算机硬件技术
无线电电子学
更多类别查询

图标索引 历史查询
 

state graph
相关语句
  状态图
     A Method For Developing Multitask System──Generalized State Graph Method
     开发多任务系统的一种方法──广义状态图方法
短句来源
     For a binary weakly invertible semi-input memory finite automaton C(Ma,f) with delay 3, where the state graph of Ma is cyclic, the characterizations of the structures are given when its minimal 3-output weight is 1, 2, and 8, respectively.
     对于自治有限自动机Ma的状态图为圈的二元延迟3步弱可逆半输入存储有限自动机C(Ma,f),给出了其长3极小输出权分别为1,2,8三种情形下结构的一种刻画.
短句来源
     This dissertation defines k-ary shift register and k-ary de Bruijn-Good graph, studies properties of the state graph of shift register and the structure of self-isomorphisms of n-stage de Bruijn-Good graph;
     本文定义了k元移位寄存器和de Bruijn-Good图,研究了移位寄存器的状态图的性质和n级de Bruijn-Good图G_n的自同构的结构;
短句来源
     We mainly study the stability of discrete Hopfield neural networks, the obtained results generalize the existing conclusion and the result can be shown intuitively combined with an example with state graph of the networks.
     主要研究离散 Hopfield神经网络的稳定性 ,所获结果推广了已有的结论 ,并结合网络状态图举例可直观地说明结果
短句来源
     Some basic properties of σ - LFSR over F4 are studied, such as nonlinearity, cycle structure distribution of state graph, the largest period and counting problem related.
     本文研究了有限域F_4上的σ-LFSR的一些基本性质,如非奇异性、状态图的圈结构的分布、最大圈的充要条件及相关的计数问题等,得到以下结论:
短句来源
更多       
  “state graph”译为未确定词的双语例句
     Based on the concepts of "domain","common" and "link", Kirschen's tracing method describes a state graph of the system and uses proportionality assumption to speed up tracing process.
     Kirschen跟踪法引入domain,common,link的概念简化了系统,根据比例假设,将潮流跟踪的速度大大提高;
短句来源
     Those criteria avoid the extra burden of extracting class state graph from class specification and make mechanical generating infra-class test cases possible.
     应用本文提出的这些用于测试类间多态关系的测试准则,测试人员可以从形式规格说明中推导出用于测试多态对象的测试用例,这些测试用例可以最终检测出程序代码中的多态关系的实现与规格说明中的定义是否一致。
短句来源
     In Chapter 2, we investigate the structure of binary feedforward inverse finite automata with delay 3. For a semi - input - memory finite automaton C(Ma, f) , where both the input alphabet and the output alphabet have two elements, the state graph of the autonomous finite automaton Ma is cyclic, when it is weakly invertible with delay3, we give the expressions of functions f and some other relationships when the minimal 3 - output weight w3,m = 1, 2, 8, respectively.
     对于输入输出字母表大小相等且为2的c阶半输入存贮有限自动机M=c(M_a,f),其中自治有限自动机M_a的状态为一回路。 当C(M_a,f)延迟3步弱可逆时,可将其按长3极小输出权W_3,M分为W_3,M=1,2,4,8四种所有可能情形。
短句来源
     According to the technique request of pulp-mold produce line, the pneumatic system has been analyzed by the way of signal-action state graph.
     根据全自动纸浆模塑生产线的工艺要求,采用信号—动作状态图法对气动系统进行分析与设计。
短句来源
     We map reachable state graph of Petri net to transition system,and give interpretation of temporal logic semantics according to transition system and Kripke structure,furthermore develop a temporal analysis method on Petri net with Model checking.
     本文通过把 Petri网转换成转移系统 ,利用转移系统和 Kripke结构给出了时序逻辑语义的解释 ,从而建立一种在 Petri网上进行时序分析的方法 . 这种方法是根据不动点理论 ,用模型检查验证公式正确性 .
短句来源
更多       
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     state.
     state.
短句来源
     State and V. T.
     Stace和V.T.
     Clock synchronization state graph
     时钟同步状态图
短句来源
     Further Research on Distribution of Graph of FCSR State
     进位反馈移位寄存器状态图分布的进一步研究
短句来源
查询“state graph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  state graph
The only requirement is that the corresponding initial state graph is finite, connected, and has a consistent state assignment.
      
Performing transformations at the state graph level has the advantage that the requirements imposed on the initial STG are very weak.
      
A constraint satisfaction framework is proposed that can guaranteenecessary and sufficient conditions for a state graph assignment to result in a transformed state graph that is free of critical races.
      
In this article, we propose a global assignment theory forencoding state graph transformations.
      
The state transition graph of the test machine is superimposed on the state graph of the object function such that a minimal number of new transitions are added.
      
更多          


LR(k) is a very important kind of grammar, but its parsing algorithm which is constructed by a canonical method needs quite many states and very large store space. Therefore LR(k) is inadequate in actual applications. Although SLR(k) grammar and LALR(k) grammar were once proposed, they are only smaller subsets of LR(k) grammar. This paper gives the concept of state graphs and state chains and defines BCLR(k) grammar. The BCLR(K) grammar is a larger subset of LR(k) grammar and includes LALR(k)...

LR(k) is a very important kind of grammar, but its parsing algorithm which is constructed by a canonical method needs quite many states and very large store space. Therefore LR(k) is inadequate in actual applications. Although SLR(k) grammar and LALR(k) grammar were once proposed, they are only smaller subsets of LR(k) grammar. This paper gives the concept of state graphs and state chains and defines BCLR(k) grammar. The BCLR(K) grammar is a larger subset of LR(k) grammar and includes LALR(k) and SLR(k) grammars as its proper subsets. However, this grammar needs as many states as SLR(k) grammar does. In the end of the paper, some changes are made in this algorithm, so that it can parse general LR(k) grammar.

LR(k)是很重要的一类文法,但是用正规方法构成的分析算法,需要过多的状态和很大的存储空间,因此它不适合于实际应用。后来虽然提出了SLR(k)和LALR(k)文法,但是它们都只是LR(k)文法较小的子集。本文给出了状态图和状态链的概念,并且定义了BCLR(k)文法。它是LR(k)文法较大的子集,并且包含了作为它的真子集的LALR(k)和SLR(k)文法。可是它所需的状态数却与SLR(k)文法一样多。在本文的最后,我们对算法作了某些改动,使之能分析一般的LR(k)文法。

In this paper a Sufficient and necessary Condition that decide a directed graph whether a directed enlerian is put forward. And give an algorithm that Search a directed Euler tonr in the directed eulerian. In addition, the algorithm that Search a shortest Euler tresil in directed noneulerian is given also. Making use of above result, We Can get a shrtest function test Sequence of Sequential Circuits, finally, that the algorithm Complexity is polynomial for the state graph of the seqnential Circuits is...

In this paper a Sufficient and necessary Condition that decide a directed graph whether a directed enlerian is put forward. And give an algorithm that Search a directed Euler tonr in the directed eulerian. In addition, the algorithm that Search a shortest Euler tresil in directed noneulerian is given also. Making use of above result, We Can get a shrtest function test Sequence of Sequential Circuits, finally, that the algorithm Complexity is polynomial for the state graph of the seqnential Circuits is proved.

本文提出了一种判别有向图是否欧拉图的充分必要条件,并给出了在有问欧拉图中找一条欧拉巡回的新的算法。除此还给出了在非有向欧拉图中找一条最短欧拉道路的算法。利用上述结果可以得到时序机的最小功能测试序列。因而使时序机最小功能测试问题得到解决(参考文献〔2〕p76),并证明对于给定时序机的状态图而言算法是多项式复杂性的。

This paper gives a necessary and sufficient condition to decide whether a digraph is a Eulerian one or not. Algorithms searching for a directed Euler tour in a Eulerian digraph and the shortest Euler trial in a non-Eulerian digraph are also developed. With the results of these algorithms, the shortest function test sequence of sequential circuits can be obtained. Finally, the complexity of all algorithms is proved to be polynomial for the state graph of a given sequential circuit.

本文提出了一种判别有向图是否欧拉图的充分必要条件,并给出了在有向欧拉图中找一条欧拉巡回的新的算法。除此,还给出了在非有向欧拉图中找一条最短欧拉道路的算法。利用上述结果可以得到时序机的最小功能测试序列,因而使时序机最小功能测试问题得到解决,并证明对于给定时序机的状态图而言算法是多项式复杂性的。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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