完全自动机

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.

他对计算机的重要贡献在于他提出的有限状态自动机也就是图灵机的概念，对于人工智能，它提出了重要的衡量标准&图灵测试&，如果有机器能够通过图灵测试，那他就是一个完全意义上的智能机，和人没有区别了。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。