您要查找的是不是：
- two way finite automaton 二向有限自动机
- two way finite automation 双向定限自动装置
- A non-deterministic finite automaton (NFA) can be constructed by linking two deterministic finite automata (DFAs). 通过两台确定型有穷自动机(DFA)的连接，构造一台非确定型有穷自动机(NFA)。
- Determination of finite automata China, NFA to DFA transformation. 有限自动机的确定华，NFA到DFA的转变。
- Two way market and have ready buyer and seller. 双边市场和现成的买卖双方。
- LACK OF ONE SET OF TWO WAY VHF ON BOARD. 这句描述有些罗嗦,是不是可以。
- A relationship between the accepting powers of sub logarithmic space bounded two way alternating pushdown automata with and without 1 inkdot is investigated. 对具有 1个墨水点的和没有墨水点的亚对数空间限定交替式下推自动机之间的关系进行研究。
- Bisected two way mirror triangle, 1998. 分为两个三角形的方式镜子， 1998年。
- The result shows that the finite automaton can accept this limit set. 结果表明：用有限自动机就可以接收该极限语言。
- There is two way to access your preset camera position. 有两种方法进入预置摄像机位置。
- 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. 有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究.
- Finite element method is employed to solve Reynolds equation and investigate dynamical performance of two way herringbone grooved liquid lubricated thrust bearing(HGTB). 采用有限元法解雷诺方程 ;研究了双向人字槽液体润滑止推轴承的承载力、轴向刚度系数和阻尼系数 ;并与相同参数下正转、反转的单向人字槽止推轴承进行比较 .
- 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. 在有限自动机公开钥密码体制中首次提出了自动机化合的概念.
- In this paper a 1 inkdot two way alternating pushdown automaton (2apda) is introduced which is a two way alternating pushdown automaton (2apda) with the additional power of marking at most 1 tape cell on the input (with an inkdot) once. 该文引入 1墨水点 2方向交替式下推自动机 ,它是 1个具有额外能力的 2方向交替式下推自动机 ,能够用 1个墨水点在输入带上标记出最多 1个单元格。
- 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. 摘要尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。
