系统首先对待切分词使用有限状态自动机进行分析。
In this paper, the authors first use FSM to analyze the stemming words.
引入有限状态自动机模型和模拟退火算法来对该问题进行求解。
The model of finite state automaton and the algorithm of simulated annealing are introduced to solve this problem.
本文利用规则与有限状态自动机相结合的方法实现动态知识联通。
The method of combining rule with finite state machine can perform the dynamic knowledge interconnectivity.
到目前为止，我们所研究的模糊或非模糊的自动机都是有限状态自动机。
The automata of fuzzy or defuzzization what we study are all finite-state automata so far.
本文利用排队论、有限状态自动机原理以及元胞自动机模型对排队系统进行建模。
The paper models queue system using queuing theory, finite state machine principle, and cellular automata model.
定义了一个扩展的有限状态自动机、一些新的逻辑转换规则，并给出了详细的分析步骤。
We define an extended finite state automaton, some new logic rules and a set of analysis steps.
格值有限状态自动机的研究：首先，提出了格值有限状态自动机的概念，它的状态转移函数定义为?。
Lattice-valued finite automata. We introduce the conpect of lattice-valued finite automata. The state transition function is defined as ?
定义了一个信任矩阵和一个动作集合，并将它们和逻辑规则一起引入有限状态自动机为协议参与者建模。
We extend finite state automata with logic rules, trust matrix and actions of principals to analyze E-commerce protocols.
详细介绍了逻辑环的管理和在其上实现网络睡眠的算法，并提出采用有限状态自动机进行网络节点状态和行为的管理。
The management of logic ring and the network sleep algorithm is introduced, and in the end, the finite state automation is proposed to manage the states and behaviors of the network nodes.
该方法以实现通用化组件为目标，将数据管理与过程管理相分离，设计与控制相分离，综合应用了工作流和有限状态自动机的相关理论。
This method aims to realize a universal component, separates data management from process management, design from control, and applies the theories of workflow and finite-state machine.
对于一类具有状态和有限自动机输出时滞的离散混合系统，给出了混合观测器的设计方法。
An observers design methodology was proposed for a kind of discrete hybrid systems with state delay and location identification delay.
该方法适宜于计算机编程操作，因此可方便地用于多输入多状态有限自动机的综合。
The method fit for the program operation of the computer can be easily used for the synthesis of a finite automation with multi-input and multi-state.
简要介绍了有限精度时间自动机(FPTA)的基本概念，重点讨论FPTA状态中时钟的表示。
Introduces the notion of Finite Precision Timed Automata (FPTA) and focuses on the representation of clocks in a state.
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。
This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.
本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。
This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.
应用推荐