| 1. | Alternating finite automaton
交替式有限状态自动机 |
| 2. | Definite state automaton
有限状态自动机 |
| 3. | Generalized definition and discussion of some concepts in finite state automata
有限状态自动机中几种概念的泛化定义及探讨 |
| 4. | Finite - state automata
有限状态自动机 |
| 5. | It uses system calls as input , and creates a fsa for the functions in the program . then the fsa is used to detect the attack
该方法使用系统调用作为输入，构建程序中函数的有限状态自动机，然后利用该自动机检测入侵事件。 |
| 6. | In chapter 2 , a class of fuzzy finite automata corresponding to the mealy type of ordinary automata is formulated and two types of statewise equivalence relations are introduced
在第二章中，对应于经典mealy型有限状态自动机的一类模糊有限状态自动机-新mealy型模糊有限状态自动机被建立。 |
| 7. | Lastly , we obtain a key theorem which charactarize the link between computing with words via lattice - valued finite automata and computing with numbers via lattice - valued finite automata . 2 . lattice - valued regular grammar
最后,严格证明了一个刻画基于格值有限状态自动机的数值计算和基于格值有限状态自动机的词计算之间的联系的一个基本定理。 |
| 8. | The paper proposes a method using finite state automation describing programming system call action via analyzing system call character , proving the finite state automation ' s completeness and giving the result of arithmetic performance
摘要通过分析系统调用行为特征，提出了程序的系统调用行为可以用有限状态自动机来描述的方法，证明了算法产生的自动机的完整性，并给出算法性能分析结果。 |
| 9. | ( 2 ) based on dfsa algorithm ( deterministic finite state automaton ) and combined with quick search algorithm , this paper analyses and implements a new multi - pattern string match algorithm that consumes less half of memory space of standard dfsa algorithm
该算法是以确定性有限状态自动机( dfsa )为基础，结合quicksearch算法而提出的，可以用来提高主题爬行器的网页分析和web网页分类器的速度。 |
| 10. | The pulsar system is developed with the following parts : the robust feature extraction based on auditory mechanisms , acoustic modeling with mandarin pronunciation characteristics , search space building based on wfst , and efficient global decoding scheme
本研究实现的系统pulsar包括：基于听感知机理的抗噪声特征提取，针对汉语发音特点的声学建模，基于加权有限状态自动机( wfst )的搜索空间，融合声学模型和语言模型的高效全局解码。 |
