Introduction, Finite Automata, Regular Expressions.
简介，有限自动机，正则运算式。
The system includes a extended finite automata and heuristic search technique.
在该系统中，使用了扩充的有限自动机和启发式搜索等技术。
Intuitionistic fuzzy finite automata theory is an important part of automata theory.
直觉模糊自动机理论是自动机理论的一个重要分支。
The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.
基于确定性有限自动机（DFA）的多模式匹配算法被广泛用于数据包深度检测系统中。
The structure of feedforward inverse finite automata is a fundamental problem in the invertibility theory of finite automata.
前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。
By analyzing the theory of Deterministic Finite Automata (DFA) and ARS, a DFA model based on animal character is established.
通过对有穷自动机理论与动物识别系统进行分析，建立了一个基于动物特征的确定型有穷自动机的模型。
The experiment to compile a regular expression into an uncertain finite automata NFA algorithm, interested friends can see Oh.
这个编译实验把一个正则表达式转化为不确定的有穷自动机NFA算法，有兴趣的朋友可以看看哦。
The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.
有限自动机理论是一类简单类算法的数学理论，这些算法理论这些数学虽然简单但对计算机科学很重要。
This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。
To meet the need of Chinese information processing, the traditional finite automata is transformed to the reversed finite automata.
根据中文信息处理的需要，把传统的有限自动机改造成了反向有限自动机。
Lattice-valued finite automata. We introduce the conpect of lattice-valued finite automata. The state transition function is defined as ?
格值有限状态自动机的研究：首先，提出了格值有限状态自动机的概念，它的状态转移函数定义为?。
Another formalism mathematically equivalent to regular expressions, Finite automata are used in circuit design and in some kinds of problem-solving.
另一数学形式等价于正则表达式，有限的自动控制用于循环设计和一些问题的的解决。
In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.
在语言理论，最简单的一类算法就是可以用有限自动机实理论可以算法现的算法，也是本书的主题。
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中的一个元素。
This thesis introduces the arithmetic design that how regular expression switches to minimum state DFA and the method how finite automata switches to regular expression.
本文主要介绍基于编译器构造技术中的由正规表达式到最小化dfa的算法设计和实现技术，以及自动机转换正规式的方法。
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.
在第二部分中，我们研究了较一般情形下前馈逆有限自动机的结构，并且讨论了弱可逆有限自动机的结构。
We extend finite automata with time sequence and define temporal finite automata, then we propose using temporal finite automat to build formal model for data fusion system.
本文提出了时序有限自动机，用它建立数据融合系统的形式化模型，并且给出了时序有限自动机模型的可达性分析方法，用于分析数据融合系统的性能和行为。
For their joint paper "Finite Automata and their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept.
“因他们的合著论文“有限自动机与其判定性问题”。”论文中引入了非确定自动机的概念，被证明是(计算理论科学研究中的)一个非常重要的概念。
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.
摘要：使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。
It is very important to investigate the decomposition of weakly invertible finite automata, since it could provide an approach to cryptanalyzing finite automata public-key cryptosystem(FAPKC).
研究弱可逆有限自动机的分解可以为分析有限自动机公开钥密码体制的安全性提供一种重要途径。
The continuous dynamics is governed by differential or difference equations, whereas the discrete dynamics is governed by finite automata that are driven asynchronously by external discrete events.
其中连续动力学由微分或者差分方程描述，离散动力学由有限的自动开关描述，并由异步的离散事件驱动。
We extend finite state automata with logic rules, trust matrix and actions of principals to analyze E-commerce protocols.
定义了一个信任矩阵和一个动作集合，并将它们和逻辑规则一起引入有限状态自动机为协议参与者建模。
The automata of fuzzy or defuzzization what we study are all finite-state automata so far.
到目前为止，我们所研究的模糊或非模糊的自动机都是有限状态自动机。
Based on principle of local action and the idea of cellular automata, a new mechanical method cellular element method is presented through inducting the discrete techniques of finite element method.
基于局部作用原理，借用有限元离散和插值技术，引入元胞自动机的演化思路，得到一种新的力学计算方法——元胞单元法。
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.
新算法由两部分构成：增加模糊字符串到最小非循环确定模糊自动机和最小化增加模糊字符串后得到的自动机。
Model checking is a formal verification by exhaustive search to finite state automata.
模型检测是基于对有穷状态自动机进行穷尽搜索的一种形式化验证方法。
Introduces the notion of Finite Precision Timed Automata (FPTA) and focuses on the representation of clocks in a state.
简要介绍了有限精度时间自动机(FPTA)的基本概念，重点讨论FPTA状态中时钟的表示。
The paper models queue system using queuing theory, finite state machine principle, and cellular automata model.
本文利用排队论、有限状态自动机原理以及元胞自动机模型对排队系统进行建模。
The paper models queue system using queuing theory, finite state machine principle, and cellular automata model.
本文利用排队论、有限状态自动机原理以及元胞自动机模型对排队系统进行建模。
应用推荐