finite automata信息详情
有限自动机
automata───n.不动脑筋机械行事的人;自动装置;小机器人(automaton的复数)
finite definition───有限定义
automata theory───自动化理论,自动机理论
finite meaning───有限意义
finite elemente───有限元
nier automata───自动肾
finite field───[数]有限域
finite state───[计] 有限状态,终止状态;有限态
finite verbs───n.限定动词
The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.───基于确定性有限自动机(DFA)的多模式匹配算法被广泛用于数据包深度检测系统中。
structure of feedforward inverse finite automata is a fundamental problem in the invertibility theory of finite automata.───前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。
This paper is concerned with the classification of fuzzy finite automata and the minimization algorithm of fuzzy finite automata.───本文研究了模糊有限自动机的分类和模糊有限自动机的状态最小化算法。
In language theory , the simplest algorithms are those which can be implemented by finite automata, the subject of this book.───在语言理论,最简单的一类算法就是可以用有限自动机实现的算法,也是本书的主题。
The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.───有限自动机理论是一类简单类算法的数学理论,这些算法理论这些数学虽然简单但对计算机科学很重要。
Use pigeon- holing arguments and closure properties to prove particular problems cannot be solved by finite automata .───运用鸽洞理论以及终止属性来证明某些特殊无法用有限自动机解决的问题…
Intuitionistic fuzzy finite automata theory is an important part of automata theory.───直觉模糊自动机理论是自动机理论的一个重要分支。
In this course we concentrate on languages (e. g. sets of words) described by finite automata, context-free grammars and Turing machines.───在这本书中我们集中讲述由有限自动机、上下文无关文法和图灵机所描述的“语言”(单词的集合)。
Finite Automata, Regular Languages, Regular Expressions.───有限自动机,正规语言,正规表示式。
- free anime games
- free archer
- arkansian
- epiphone les paul
- arket
- arkansawyers
- be charged with murder
- arketf
- give it up for anything
- angiocyst
- finite balls
- angiocuinosis
- angiocrinosis
- calibrationstatus
- bellyfusions
- be charged with pain
- be charged with sth
- bellyfull
- finite clause
- be charged with tension
- be charged with the task of