This paper introduces the defination of multiplicity automata and analyzes the relationship of multiplicity automata and deterministic automata or non_deterministic automata.
简单介绍了多路自动机的定义，分析了多路自动机和有限自动机的关系，包括确定的有限自动机和非确定的有限自动机，并且给出了例子。
For example, the XAUST XML compressor converts the schema information of the DTD into a set of deterministic finite automata (DFA), one for each element in the DTD.
例如，XAUSTXML压缩器将DTD的模式信息转换成一组确定性有限自动机(DFA)，每个DFA对应于DTD中的一个元素。
The new algorithm is composed of two parts: adding fuzzy strings to minimal acyclic deterministic fuzzy finite state automata (ADFFAs) and minimizing the resulting automata.
新算法由两部分构成：增加模糊字符串到最小非循环确定模糊自动机和最小化增加模糊字符串后得到的自动机。
The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.
基于确定性有限自动机（DFA）的多模式匹配算法被广泛用于数据包深度检测系统中。
We presented a new semi-incremental algorithm, which combines with properties of acyclic deterministic fuzzy automata.
所以这个新的不完全增加结构算法较传统算法更可行和实用。
By analyzing the theory of Deterministic Finite Automata (DFA) and ARS, a DFA model based on animal character is established.
通过对有穷自动机理论与动物识别系统进行分析，建立了一个基于动物特征的确定型有穷自动机的模型。
In Chapter 2, we present a new semi-incremental algorithm, which combined with properties of acyclic deterministic fuzzy automata.
第二章提出了一种新的不完全的增加结构算法，该算法结合了非循环确定模糊自动机的性质。
Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.
摘要：使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。
Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.
摘要：使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。
应用推荐