- 更多网络例句与完全自动机相关的网络例句 [注：此内容来源于网络，仅供参考]
-
In Chapter 2, we present a new semi-incremental algorithm, which combined with properties of acyclic deterministic fuzzy automata.
第二章提出了一种新的不完全的增加结构算法，该算法结合了非循环确定模糊自动机的性质。
-
We presented a new semi-incremental algorithm, which combines with properties of acyclic deterministic fuzzy automata.
我们提出了一种新的不完全的增加结构算法，该算法结合了非循环确定模糊自动机的性质。
-
We have established some properties of languages of Lattice of Quantum Automata. For example, the definitions of Right-Linear Grammars of Lattice of Quantum, Regular Sets of Lattice of Quantum and Regular Expressions of Lattice of Quantum have been given.
我们证明了量子自动机格有一些重要的性质：它是分配格当且仅当自动机的基格是分配的；它是模格当且仅当自动机的基格是模格；它是完全格当且仅当自动机的基格是完全格。
-
If As is deterministic, the problem can be solved in PSPACE, however, if As is nondeterministic, the problem is undecidable.
若A_S是确定的时间自动机，此问题是PSPACE完全的，然而，若A_S是非确定的，则此问题是不可判定的。
-
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.
他对计算机的重要贡献在于他提出的有限状态自动机也就是图灵机的概念，对于人工智能，它提出了重要的衡量标准&图灵测试&，如果有机器能够通过图灵测试，那他就是一个完全意义上的智能机，和人没有区别了。
- 更多网络解释与完全自动机相关的网络解释 [注：此内容来源于网络，仅供参考]
-
completely separated sets：完全可离集
completely regular topology 完全正则拓扑 | completely separated sets 完全可离集 | completely specified automaton 完全自动机
-
completely specified automaton：完全自动机
completely separated sets 完全可离集 | completely specified automaton 完全自动机 | completely splitted prime ideal 完全分裂素理想
-
completely splitted prime ideal：完全分裂素理想
completely specified automaton 完全自动机 | completely splitted prime ideal 完全分裂素理想 | completely transitive group 全可迁群
-
completely uniformizable space：完全可一致化空间
completely specified automation | 完全确定自动机 | completely uniformizable space | 完全可一致化空间 | completely unimodular matrix | 完全幺模矩阵