| 1. | Figure recognition based on deterministic finite automat
图形识别的有限自动机方法 |
| 2. | Finite automata model for one type of dna computing system
计算系统的有限自动机模型 |
| 3. | A feasible method for achieving finite automaton
有限自动机的类类型实现方法 |
| 4. | Several properties of two operators of fuzzy finite aatomata
模糊有限自动机两个算子的若干性质 |
| 5. | Tao rj . invertibility of finite automata . beijing : science press , 1979 ( in chinese )
陶仁骥.有限自动机的可逆性.北京:科学出版社, 1979 |
| 6. | As discussed last month , i plan to use deterministic finite automaton to compile the proxy
如上个月所讨论的，我计划用确定性有限自动机（ deterministic finite automaton ， dfa ）来编译该代理。 |
| 7. | This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。 |
| 8. | This task can be achieved by a finite automaton with just two states and a “ program ” consisting of four statements called transition rules
有限自动机在执行这项工作时，只需要两个状态和一套含四则转换规则的程序。 |
| 9. | Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ) , a dfa has been designed , which can identify multiple kind numbers
摘要基于有限自动机的多模式匹配算法（ dfsa算法） ，设计出同时识别多种数的有限自动机。 |
| 10. | Based on this classification , some important types of fuzzy finite automaton are classified . in the meantime , the relations among these fuzzy finite automata in same models are obtained
同时，在新分类中，在同一类型中的各种原模糊有限自动机类型之间的等价或从属关系被证明和获得。 |
