该词条未找到_海词词典

您要查找的是不是：

Determination of finite automata China, NFA to DFA transformation. 有限自动机的确定华，NFA到DFA的转变。
The result shows that the finite automaton can accept this limit set. 结果表明：用有限自动机就可以接收该极限语言。
So the storage structure of finite automaton should the choosed adjacency lists. 所以，有穷自动机的存储结构最好采用邻接链表来存储。
In 1985, the finite automaton public key cryptosystem was proposed. It stimulates the investigation of invertibility of finite automata. 有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究.
A non-deterministic finite automaton (NFA) can be constructed by linking two deterministic finite automata (DFAs). 通过两台确定型有穷自动机(DFA)的连接，构造一台非确定型有穷自动机(NFA)。
The highway toll collector system was researched by using the finite automata theory. 利用有穷自动机理论研究了高速公路收费站的收费系统。
The concept of composition of finite automata is first proposed in finite automaton public key cryptosystem. 在有限自动机公开钥密码体制中首次提出了自动机化合的概念.
Use pigeon-holing arguments and closure properties to prove particular problems cannot be solved by finite automata . 运用鸽洞理论以及终止属性来证明某些特殊无法用有限自动机解决的问题。.
In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this book. 在语言理论，最简单的一类算法就是可以用有限自动机实现的算法，也是本书的主题。
In the second part, we study the structure of feedforward inverse finite automata in general case, and we also discuss the structure of weakly invertible finite automata. 在第二部分中，我们研究了较一般情形下前馈逆有限自动机的结构，并且讨论了弱可逆有限自动机的结构。
Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata. 摘要尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。
Associating with the actual condition in the industrial control field,the paper presents a software development model based on finite automata(FA). 结合工业控制领域中的实际情况,提出了一种基于有限自动机的软件开发模型。
Finite automata representations of XML, XML Schema and path expression and the correlation relationship between XML NFA and Schema DFA. 2)以有限自动机为工具,给出了XML,XML Schema,路径表达式的自动机表示形式,以及它们之间的关系。
By analyzing the theory of Deterministic Finite Automata (DFA) and ARS, a DFA model based on animal character is established. 通过对有穷自动机理论与动物识别系统进行分析，建立了一个基于动物特徵的确定型有穷自动机的模型。
By analyzing the theory of Deterministic Finite Automata(DFA)and ARS, a DFA model based on animal character is established. 通过对有穷自动机理论与动物识别系统进行分析;建立了一个基于动物特征的确定型有穷自动机的模型.
In this course we concentrate on languages (e.g. sets of words) described by finite automata, context-free grammars and Turing machines. 在这本书中我们集中讲述由有限自动机、上下文无关文法和图灵机所描述的“语言”（单词的集合）。
In this paper it introduces an approach to compress and code gray image using deterministic Generalized Finite Automata(GFA). 提出一种用确定性的广义有限自动机(GFA)对灰度图像进行压缩编码的方法。
The mul ti-model matchi ng with the reversed finite automata is discussed and the formalization of the a lgorithm is presented. 讨论了利用反向有限自动机进行多模式的匹配，并给出了形式化的算法。
To meet the need of Chinese information processing, the traditional finite automata is transformed to the reversed finite automata. 根据中文信息处理的需要，把传统的有限自动机改造成了反向有限自动机。
Another formalism mathematically equivalent to regular expressions, Finite automata are used in circuit design and in some kinds of problem-solving. 另一数学形式等价于正则表达式，有限的自动控制用于循环设计和一些问题的的解决。