- 更多网络例句与穷自动机相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Computer application; Chinese information processing; Chinese character input; mathematical model; two-way Chinese finite automaton
关键字］计算机应用；中文信息处理；汉字输入；数学模型；双向有穷自动机
-
Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata.
尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。
-
A finite automaton was used to build up the shallow water ray tracing model,and the model state,transition, event and action were analyzed.
用有穷状态自动机对浅海的声线追踪建模，给出了浅海声线追踪内在的状态及状态转移分析。
-
So the storage structure of finite automaton should the choosed adjacency lists.
所以，有穷自动机的存储结构最好采用邻接链表来存储。
-
Finite automaton, a computational model of extremely limited computing ability, was proved to have the capability of solving primeness test by construction.
有穷自动机，一种计算能力极其有限的计算模型，具有解决素性测试的能力通过构造法得到了证明。
-
A shallow water acoustic field algorithm using finite automaton was presented.
提出一种用有穷状态自动机研究浅海声场的方法。
-
This paper makes some studied in the building of Chinese character input modes based on automata theoretic, handles the control operation in the input model, and introduces the concepts of two-way deterministic Chinese finite automaton and two-way nondeterministic Chinese finite automaton.
本文从自动机理论的角度对汉字输入的数学模型进行了研究，把控制操作引入了输入模型，并给出确定汉字双向有穷自动机和不确定汉字双向有穷自动机的模型。
-
The highway toll collector system was researched by using the finite automata theory.
利用有穷自动机理论研究了高速公路收费站的收费系统。
-
Firstly, the disadvantageous of the present system' in operation was analyzed and the relevant automaton state diagram was painted. Furthermore, according to the finite automaton is a useful model, the new automatic system, that is, the toll collector system by charging to the account was designed and the relevant automaton state diagram was painted.
首先分析了现行的自动收费站系统中的不足之处，画出了相应的自动机状态转移图，然后依据有穷自动机是一种具有离散输入输出系统的数学模型，提出了新的收费站自动机设计－记账式收费自动机的模型及相应的自动机状态转移图，进而给出了详细的分析和应用软件，并画出了相应的系统模块图。
-
The method provides theoretic basis for divergence of agent levels,then translates operational goals set into HRAFSM,at last simulatively executes operational goals set according to simulation executing HRAFSM.
该方法为代理的层次划分提供了理论支持，并将操作目标集合转换成了基于规则的层次式有穷状态自动机，通过对基于规则的层次式有穷状态自动机的模拟执行，达到了对操作目标集合的模拟执行。
- 更多网络解释与穷自动机相关的网络解释 [注：此内容来源于网络，仅供参考]
-
finite-state automata：有穷状态自动机
元胞自动机理论:Cellular Automata theory | 有穷状态自动机:Finite State Automata | 模糊元胞自动机:Fuzzy cellular automata
-
finite automaton：有穷自动机
同态 homomorphism | 有穷自动机 finite automaton | 有穷自动机最小化 minimization of finite automaton
-
deterministic finite automaton：确定型有穷自动机
确定型上下文有关语言 deterministic CSL | 确定型有穷自动机 deterministic finite automaton | 确定型下推自动机 deterministic pushdown automaton
-
deterministic finite automaton：确定的有穷自动机,决定性有限自动机,决定性有限自动机
deterministic expression 确定的表达式 | deterministic finite automaton 确定的有穷自动机,决定性有限自动机,决定性有限自动机 | deterministic interconnection 确定性关联
-
non-deterministic finite automaton：非确定型有穷自动机
非终极符 non-terminal | 非确定型有穷自动机 non-deterministic finite automaton | 非确定型图灵机 non-deterministic Turing machine
-
two-tape finite automaton：双带有穷自动机
双栈机 two-stack machine | 双带有穷自动机 two-tape finite automaton | 双带图灵机 two-tape Turing machine
-
two-way finite automaton：双向有穷自动机
双向无穷带 two-way infinite tape | 双向有穷自动机 two-way finite automaton | 双栈机 two-stack machine
-
nondeterministic automaton：不确定性自动机,不确定自动机
nondeterminisitc Turing machine 不确定的图灵... | nondeterministic automaton 不确定性自动机,不确定自动机 | nondeterministic finite automaton 不确定的有穷自动机,不确定性有限自动机,非确定的有限...
-
nondeterministic finite automaton：不确定的有穷自动机,不确定性有限自动机,非确定的有限自动机
nondeterminisitc Turing machine 不确定的图灵机 | nondeterministic finite automaton 不确定的有穷自动机,不确定性有限自动机,非确定的有限自动机 | nondeterministic program 不确定程序
-
finite-turn PDA：有穷转向下推自动机
有穷性问题 finiteness problem | 有穷转向下推自动机 finite-turn PDA | 有限控制器 finite controller