2) finite automata
有限自动机
1.
The normal form of regular expressions of finite automata;
有限自动机的正则表达式的范式
2.
Application of finite automata based on its matrix model--New method for determining property of r-order input memory in finite automata;
有限自动机矩阵模型的应用——有限自动机r阶输入存贮性质判定新方法
3.
Testing object-oriented software specification based on finite automata;
基于有限自动机的面向对象软件规约测试
3) finite automation
有限自动机
1.
In this paper, a new method is proposed of digital image information processing based on the principles of finite automation for the great amount of data in video information processing.
运用有限自动机理论,针对多路视频信息处理量大的问题,提出了一种新的对数字图像信息加工处理方法。
2.
the input signals of the finite automation were regarded as the addresses of the EPROM memory, and the appropriate state messages were stored in the corresponding locations.
把有限自动机每一状态及在此状态下的输入信息作为地址,对应这个地址的存储单元存放下一个状态及输出信息,通过对EPROM的读操作,使数据线上产生相应的输出,实现自动机的动作。
3.
Automation-rule base design method to the design of electronic lockstitch bar tacker control system is presented, which has well satisfied the real-time, accuracy, high speed and matching requirements for electronic lockstitch bar tacker action and greatly improved the sewing efficiency according to matching the finite automation state diagram with the rule base principles.
阐述了智能打结机控制系统的功能和控制原理,结合有限自动机和规则库理论提出了打结机控制系统一种新的设计方法,即自动机-规则库设计方法。
4) finite automaton
有限自动机
1.
Application of finite automaton in detection of composite event
有限自动机在复合事件检测中的应用
2.
A deterministic finite automaton M k(A→λ, φ) is constructed.
引入符号串的k-前缀,给出LR(k)项集Ik(α)及其基本集Bk(α)的定义,研究了Ik(α)的性质与相互关系,在此基础上构造了有限自动机Mk(A→λ,φ),进而证明了{αφ|(A→λ,φ)∈Ik(α)}是正规集,并给出了Ik(α)的构造。
3.
Non-deterministic finite automaton is translated into deterministic finite automaton.
一般非确定有限自动机转化为确定的有限自动机,其时间复杂度是指数函数级。
5) finite state machine
有限自动机
1.
This paper describes the elements of the finite state machine, establishes the finite state machine models for two practical processes.
介绍了有限自动机的基本组成,给出了两个实际过程的有限自动机模
6) finite state automaton
有限自动机
1.
For the weakness of low string matching speed,a fast algorithm to perform multiple pattern matching in a string,based on finite state automaton combined with Boyer-Moore(BM) algorithm and an improved quick search(QS) algorithm,was presented.
针对目前匹配速率过慢的问题,在有限自动机的多模式匹配算法的基础上,结合Boyer-Moore(BM)算法和改进的quick search(QS)算法的优点,提出了一个快速的多模式字符串匹配算法。
补充资料:广义
范围较宽的定义(跟‘狭义’相对):~的杂文也可以包括小品文在内。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条