有限自动机

有限自动机的CAD

CAD of the finite automaton

有限自动机RTL描述的一种有效逻辑转换

An effective logic transform for the finite automaton RTL description

基于词计算的Fuzzy有限自动机的等价问题

Equivalence of Fuzzy Finite Automata Based on Computing with Words

Fuzzy有限自动机语言的运算封闭性

Closure of fuzzy finite - state automaton languages

基于有限自动机的Web服务行为的描述与发现

The Description and Discovery of Web Service Behavior Based on the Deterministic Finite State Automation

一种DNA计算系统的有限自动机模型

Finite automata model for one type of DNA computing system

拟（h，k）存贮有限自动机的可逆性

Invertibility of finite automata with quasi - ( h , k ) - order memory

基于TCP状态有限自动机的入侵检测研究

Research of intrusion detection system based-on state automaton about TCP protocol

用有限自动机和拓扑排序理论提高MIS开发效率

Applying Finite Automat and Topological Sort To Improve Efficiency Of MIS Development

Tabular氧化铝的显微结构有限自动机的最小化

Microstructure of tabular alumina Minimization of Finite Automation

西文OCR后处理中的有限自动机模型

The Finite Automaton Model in Western Language OCR Post-processing

如上个月所讨论的，我计划用确定性有限自动机（DeterministicFiniteAutomaton，DFA）来编译该代理。

As discussed last month , I plan to use Deterministic Finite Automaton ( DFA ) to compile the proxy .

确定的有限自动机（DFA）化简方法改进

Amelioration on Simplified Method for Deterministic Finite State Automata

讲得更具体些，在上篇专栏文章中，我回顾了编译所谓“确定性有限自动机（DeterministicFiniteAutomaton，简称DFA）”的一些算法。

Most specifically , in the last column I reviewed algorithms to compile a so-called Deterministic Finite Automaton ( DFA ) .

该模型通过建立转向（goto）函数、失效（failure）函数和输出（output）函数，利用树型有限自动机实现了对机车信号快速准确的故障诊断。

The Goto function , failure function and output function are established and the model achieves fast and exact fault diagnosis by using dendriform finite state automata .

有限自动机M的RTL描述

A RTL description for the finite automaton M

在上一篇专栏文章中，我们编写了在所谓的“确定性有限自动机（DeterministicFiniteAutomaton或简称DFA）”中编译一组XPath的逻辑。

In the last column , we wrote the logic to compile a set of XPath in a so-called Deterministic Finite Automaton or DFA .

基于模糊字符串的Mealy格值有限自动机及其最小化

Minimization of Mealy Lattice Finite Automata Based on Fuzzy Strings

本文提出用确定性的有限自动机（DFA）进行图像压缩编码的方法。

In this paper , we suggest an approach to compress image using Deterministic Finite Automata ( DFA ) .

由于C（Ma，f）延迟3步弱可逆当且仅当它是延迟3步弱逆，因此，得到了二元延迟3步前馈逆有限自动机结构的一种部分刻画。

Because C ( Ma , f ) is weakly invertible with delay 3 iff it is weakly inverse with delay 3 , a partial characterization of the structure of binary feedforward inverses with delay 3 is obtained .

有限自动机的同步序列和UIO序列

Synchronous Sequences and UIO Sequences of Finite Automata

元胞自动机（CellularAutomata，简称CA）是一类特殊的无输出有限自动机，它是由规则排列的元胞组成的离散动力系统，任一个元胞都可被赋值。

Cellular automata ( CA ) are special finite automata without output . They are discrete systems consisting of a regular array of cells , each of which can be assigned a value .

利用矩阵的Kronecker积，给出了模糊有限自动机的新的乘积。

The definitions of new products of fuzzy finite state machines are given by application of Kronecker product .

有限自动机积的初（末）态试验序列、UIO序列和同步序列

Initial ( Final ) State Testing Sequence , UIO Sequence and Synchronous Sequence of Product of Finite Automata

在有限自动机的多模式匹配算法（DFSA算法）的基础上，结合QuickSearch算法的优点，提出了一个快速的多模式字符串匹配算法。

Combined with the advantages of the Quick Search algorithm , a faster algorithm to perform multiple patterns match in a string is put forward on the basis of deterministic finite state automata ( DFSA ) .

在有限自动机矩阵模型表示方法基础上，采用矩阵理论和布尔代数为工具，主要对布尔状态映射矩阵B（x）进行讨论。

Based on the matrix model of a finite automata and with the tools of the Matrix theory and the Boolean algebra , this paper discusses mainly on the Boolean-state-mapping Matrix . Firstly we give a series of transformations to the Boolean-state-mapping matrix B ( x ) .

本文在对信号状态建立DFA（确定有限自动机）模型的基础上，给出了一个基于OOD的开发信号图形显示的标准应用框架及其实现方法。

This paper presents a general purpose application frame with its implementation for development of signal display software using Object Oriented Design based on Deterministic Finite Automation modeling .

针对轨道交通列车运行控制系统的特点，在有限自动机模型的基础上提出时间自动机网络模型，并且给出模型的形式化定义和相关特性，提出时间自动机网络模型的形式化描述语言TAN语言。

The main innovative works are : ( 1 ) TAN ( Timed Automata Network ) model is proposed to deal with train control system and the formal definition and characters are given based on finite automata theory .

分析了航班计划基本要素的正规式和航班计划上下文无关文法，构造了对应的不确定有限自动机和语法分析树，并研究了LR分析的应用。

The regular expression of the basic elements and context-free grammar of flight scheduling were analyzed . Corresponding non-deterministic finite automata and abstract syntax tree were constructed , and LR parse was used .

文章的重点在于软件结构模型的建模流程，其中涉及了多个算法及Markov链与概率有限自动机关系的阐述，度量熵与传统可靠性模型间关系的推导。

The processing of model the software architecture is the core , which involved a number of algorithms , the relationship between Markov chain and the stochastic finite automaton , deducing the functional relationship between metric entropy and the traditional software reliability model .