您要查找的是不是:
- The highway toll collector system was researched by using the finite automata theory. 利用有穷自动机理论研究了高速公路收费站的收费系统。
- generalized finite automaton theory 广义有限自动机理论
- Optimizing and Software for Automated Toll Collector Based on the Finite Automata Theory 利用自动机理论对收费站收费系统进行设计并实现
- finite automata theory 有限自动机理论
- finite automaton theory [计] 有限自动机理论
- In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this book. 在语言理论,最简单的一类算法就是可以用有限自动机实现的算法,也是本书的主题。
- 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. 通过对有穷自动机理论与动物识别系统进行分析;建立了一个基于动物特征的确定型有穷自动机的模型.
- Based on the matrix model of a finite automata and with the tools of Matrix Theory and Boolean Algebra,a new method for minimizing a finite automata is presented in this paper. 论文基于有限自动机的矩阵模型????并以矩阵理论和布尔代数为工具,给出了一种有限自动机极小化的新方法。
- Determination of finite automata China, NFA to DFA transformation. 有限自动机的确定华,NFA到DFA的转变。
- Based on the matrix model of a finite automataand with the tools of Matrix Theory and Boolean Algebra,a new method for determining the equivalence between finite automata has been presented in this paper. 该文在有限自动机的矩阵模型表示方法1基础上,采用矩阵理论和布尔代数为工具,提出了一种有限自动机等价判定的新方法。
- Automaton theory is a basic theory of compile routine for identifying words. 自动机理论是编译程序中单词识别的基本理论。
- The result shows that the finite automaton can accept this limit set. 结果表明:用有限自动机就可以接收该极限语言。
- So the storage structure of finite automaton should the choosed adjacency lists. 所以,有穷自动机的存储结构最好采用邻接链表来存储。
- Based on the cellular automata theory,a new method of designing irregular weave by computer is introduced. 以细胞自动机理论为基础,提出了不规则组织计算机辅助设计的新思路。
- 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 concept of composition of finite automata is first proposed in finite automaton public key cryptosystem. 在有限自动机公开钥密码体制中首次提出了自动机化合的概念.
- Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. 目前对属性文法循环性问题复杂度的证明,多基于自动机理论,如写入推出接受器、交替涂林机等。
- Use pigeon-holing arguments and closure properties to prove particular problems cannot be solved by finite automata . 运用鸽洞理论以及终止属性来证明某些特殊 无法用有限自动机解决的问题。.