- 更多网络例句与自动机图相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Cellular Automaton ; Karnaugh Map ; Function Form ; Evolution Property
元胞自动机；卡诺图；函数形式；演化性质
-
The new algorithm is composed of two parts: the first is called E-reduction, which contracts states that are equivalent and the second is called RE- reduction, which removes states which are in the maximal acyclic subgraph.
这个新算法包括两部分：第一部分是合并模糊自动机中的等价状态；第二部分是移出模糊自动机中的最大非循环子图中的状态。
-
By means of the model, the extended finite automaton is converted into improved state charts, and then into multifunction views.
该模型对基本有限自动机进行了扩充；将扩充后的有限自动机转换成为改进状态图：根据改进状态图构造多功能视图；在此基础上进行软件开发。
-
The paper improves the velocity's control rules of a first-order microcosmic stochastic traffic cellular automaton model and incorporates it's stochasticity as a deceleration parameter in the construction of the fundamental diagram used by a macroscopic first-order continuum traffic model.
本文对微观一维随机元胞自动机交通流模型的速度控制规则进行了改进，并将其随机特性转化为减速参数合并到宏观一阶连续介质理论交通流模型中，重新构建了反映流量——密度的交通流基本图。
-
Linear temporal logic properties of the system can be verified based on the automata theory of model checking. The method of verifying a complex multi-object system modeled by Statecharts and collaboration diagram is also presented in this paper.
使用基于自动机理论的模型检验方法来验证UML Statecharts的线性时态逻辑性质，并给出方法验证由Statecharts和协同图建模的复杂多对象系统。
-
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.
首先分析了现行的自动收费站系统中的不足之处，画出了相应的自动机状态转移图，然后依据有穷自动机是一种具有离散输入输出系统的数学模型，提出了新的收费站自动机设计－记账式收费自动机的模型及相应的自动机状态转移图，进而给出了详细的分析和应用软件，并画出了相应的系统模块图。
-
Data exchange was through files.As an example of DXF source file,it established an automaton of the line entity,traced red information through state transition graph.
以DXF格式源文件为例，建立图形实体自动机模型，通过状态转换图跟踪读取信息的轨迹；并给出了城市道路仿真模型在目标平台上重生成时的UML类图。
-
Firstly, system model depicted by TSIOA is transformed into an USTGSS (untimed stable label transition graph of symbolic state) which does not contain abstract time delay transitions. Then, the testing methods based on LTS are used to the generate transition sequences from USTGSS according to structural coverage criteria. Finally, a process of constructing and executing the test cases is given, in which object functions of time delay variables are imported, and time delay variables used in the transition sequences are solved dynamically by linear programming techniques.
该方法首先将时间安全输入/输出自动机描述的系统模型转换为不含抽象时间延迟迁移的稳定符号状态迁移图(untimed stable transition graph of symbolic state，简称USTGSS)；然后采用基于标号迁移系统(labeled transition system，简称LTS)的测试方法来静态生成满足各种结构覆盖标准的包含时间延迟变量迁移动作序列；最后，给出了一个根据迁移动作序列构造和执行测试用例的过程，该过程引入了时间延迟变量目标函数，并采用线性约束求解方法动态求解迁移动作序列中的时间延迟变量。
-
According to the analysis of min-cut partitioning problem,we give a Cellular Automata model for this problem by applying the cellular automata theory and propose a min-cut optimization algorithm based on this model for bisecting graph.
运用元胞自动机理论，针对无向图剖分优化问题进行了分析和建模，提出了一种元胞自动机模型以及基于该模型的无向图剖分优化算法。
-
Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted "Turing" version of the Church Turing thesis, namely that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine.
他对计算机的重要贡献在于他提出的有限状态自动机也就是图灵机的概念，对于人工智能，它提出了重要的衡量标准&图灵测试&，如果有机器能够通过图灵测试，那他就是一个完全意义上的智能机，和人没有区别了。
- 更多网络解释与自动机图相关的网络解释 [注：此内容来源于网络，仅供参考]
-
automata：自动机
大数学家高斯(Gauss)也参加过,他受了Pascal的影响还考虑了自动机(automata)的事. 因为计算机也同时是一种自动机. 英国哲学家波普尔(Karl Popper)在>中说,"柏拉图主义超出了身心二元性范围. 它引出一个三分世界,
-
automaton graph：自动机图
automaton 自动机 | automaton graph 自动机图 | automorphic form 自守形式
-
automorphic form：自守形式
automaton graph 自动机图 | automorphic form 自守形式 | automorphic function 自守函数
-
non-deterministic finite automaton：不确定有限自动机
非确定图 nondeterministic diagram | 非确定性有限自动机 nondeterministic finite automaton | 不确定有限自动机 non-deterministic finite automaton
-
nondeterministic automaton：不确定性自动机,不确定自动机
nondeterminisitc Turing machine 不确定的图灵... | nondeterministic automaton 不确定性自动机,不确定自动机 | nondeterministic finite automaton 不确定的有穷自动机,不确定性有限自动机,非确定的有限...
-
nondeterministic finite automaton：非确定性有限自动机
非确定图 nondeterministic diagram | 非确定性有限自动机 nondeterministic finite automaton | 不确定有限自动机 non-deterministic finite automaton
-
code walkthrough：代码走查
●代码走查(code walkthrough) 和代码审查(code inspection) 是两种不同的代码评审方法,这两种方法的主要区别是____(14)____ . ●某一确定有限自动机(DFA) 的状态转换图如下图所示,该DFA接受的字符串集是____(28)___ ,与之等价的正规式是___(29)___ .