- 更多网络例句与计算自动机相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Now that the L-valued fuzzy state automata has such powerful computation capacity, it is necessary to traverse the algebraic properties such as transformation semigroups,products and covering relations in L-valued fuzzy automata in order to show the close correspondence between the algebraic properties and the latticeordered monoid.
既然格值自动机具有如此强大的计算能力，有必要对其从代数角度出发较详细地，较深入地研究此类自动机的变换半群，乘积和覆盖关系，揭示此类自动机的代数性质和格半群间的紧密联系。
-
In this paper, the overall design scheme of one assault rifle prototype with double cyclic systems and variable firing rate is illuminated in brief and the related analytical models of one DOF and two DOF by the basic theory of dynamics of multi-rigid-body system is established. The calculating analogue program in VB computer language for analyzing the movement regularities of floating body of the assault rifle prototype with some universal property and function of man-machine conversation is completed. The comparison between the calculating results and the experimental results is conducted also.
本文对某步枪双循环变射频发射原理样机方案进行了简单的说明，应用多刚体系统动力学基本理论建立了原理样枪的一自由度和二自由度动力学分析模型，用VB编写了具有一定通用性和人机对话功能的自动机运动规律分析计算程序，并将计算结果与试验结果进行了比较，验证了数理模型的正确性。
-
It takes less time to get the model approximation than rectangular automata method and flow pipe method.
相比于基于矩形自动机和流管道方法的模型近似，计算时间显著减小。
-
The study of coalgebraic methods, as one of the active areas for theoretical computer science in recent years, is widely used in concurrence computing model, automat theory, and the foundations of object-oriented technology.
共代数方法是近几年来理论计算机科学的研究热点之一，在并行计算模型、自动机及面向对象技术的理论基础方面有着广泛的应用。
-
With progress in parallel computation, as well as in biology, cellular automata become more and more important.
随着并行计算，以及在生物学，细胞自动机变得越来越重要。
-
Computational theory of the three traditional core areas: automata, computability and complexity.
计算理论的三个传统的核心领域：自动机、可计算性和复杂性。
-
The pushdown automata described in this paper are more powerful than the existing finite automaton in computing theory.
计算理论表明，该种下推自动机的计算能力超过了已有的有限自动机。
-
A fixed finite automaton, when used on inputs of arbitrary size, can compute only very primitive functions, and is not an adequate computation model in itself.
一个固定的有限自动机，投入使用时，任意大小，可以计算非常原始的功能，并没有足够的计算模型本身。
-
Finite automaton, a computational model of extremely limited computing ability, was proved to have the capability of solving primeness test by construction.
有穷自动机，一种计算能力极其有限的计算模型，具有解决素性测试的能力通过构造法得到了证明。
-
Winfree proved that self-assembling tile systems in a plane are capable of doing universal computation, and when restricted to a line are exactly as powerful as discrete finite automa.
Winfree已经证明平面上的片装配系统能做通用的计算，而线性自装配模型的计算能力相当于离散的有限自动机。
- 更多网络解释与计算自动机相关的网络解释 [注：此内容来源于网络，仅供参考]
-
calculating automaton：计算自动机
calculate 计算 | calculating automaton 计算自动机 | calculating circuit 计算电路
-
calculating circuit：计算电路
calculating automaton 计算自动机 | calculating circuit 计算电路 | calculating element 计算单元
-
Robin Milner：可计算函数逻辑先驱
算法领域先驱--Richard M. Karp | 可计算函数逻辑先驱--Robin Milner | 有限自动机与其判定性先驱--Michael O. Rabin
-
nondeterministic automaton：非确定性自动机
非确定性算法 nondeterministic algorithm | 非确定性自动机 nondeterministic automaton | 非确定性计算 nondeterministic computation