您要查找的是不是：
- Based on the definitions of bifuzzy successor and bifuzzy source operators of fuzzy finite automata in [1],in this paper,we study their basic properties and their essential relationships. Finally,several important results are obtained. 在文[1]定义了模糊有限自动机的bifuzzy seccessor算子和bifuzzy source算子的基础上,着重研究它们之间的基本性质及关系,并得到几个重要的性质定理。
- Lattice-valued fuzzy finite automata 格值自动机
- acyclic deterministic fuzzy finite automaton 非循环确定模糊自动机
- Minimization of Fuzzy Finite Automata and Its Application in ECG Fuzzy有限态自动机的最小化及其在心电图（ECG）识别中的应用
- Incremental Construction of Minimal Acyclic Deterministic Fuzzy Finite Automaton 增加结构非循环模糊自动机最小化算法
- fuzzy finite automata 模糊有限自动机
- Fuzzy Finite Automata (FFA) 模糊有限自动机
- 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. 在有限自动机公开钥密码体制中首次提出了自动机化合的概念.
- In view of the difficulty to solve fuzzy finite element equation by using the existing methods, a new solution approach based on th perturbation method was proposed. 该方法假定当不确定参数相对于其清晰值的分解度不很大时，可以将其在清晰值附近作摄动展开。
- 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). 结合工业控制领域中的实际情况,提出了一种基于有限自动机的软件开发模型。
- 今日热词
-
- 深远海浮式风电平台 - deep-sea floating wind power platform
-
- 京雄高速公路 - Beijing-Xiongan expressway
-
- 农业及相关产业增加值 - the added value of agriculture and related industries
