自动机

Based on the failure characters of concrete structures, the two-dimensional physical cellular automaton, a model cellular automaton, is set up.

根据混凝土的结构与破坏特征，建立了一种细胞自动机一～二维物理细胞自动机的基本模型。

In combining with the deterministic propositional dynamic logic, the composable problem of the goal service is determined.

通过使用有限状态自动机，服务组成的社区中的状态和操作可以使用有限状态自动机来模拟，这样可以表示服务操作的内部和外部概要。

The analysis in theory proves that cellular automaton is equal with a stochastic process that described by stochastic difference equations. The primary differential equation is expectation of this stochastic process. And its variance function is controllable. These results show that cellular automata are in agreement with primary differential equation in the statistical sense.

理论分析证明：该方法设计的细胞自动机等价于一个可用随机差分方程描述的随机过程，该随机过程以原微分方程为期望函数，并且，其方差函数是可控的，表明细胞自动机和原微分方程在统计意义上是一致的。

According to the characteristics of elementary cellular automata, partitioned matrix is employed to define t he local rules in the form of the matrix for the elementary cellular automata.

针对初等细胞自动机的特点，使用分块矩阵对初等细胞自动机的局部规则进行了基于矩阵形式的定义。

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.

这个新算法包括两部分：第一部分是合并模糊自动机中的等价状态；第二部分是移出模糊自动机中的最大非循环子图中的状态。

As for a given automata,there exists three cases:for some state which did not being visited, for some state itself indeed being not reachable although it has been visited,for some state it is equivalent to other states though it can be reached to, in these three cases it is obviously redundant to construct these automata, and the only way for us is to delete,integrate and reduct these useless states in order to minimize the number of states.

对于一个给定的自动机，它的状态中有一些根本没有被访问过，有一些尽管被访问过，但是本身是不可达的，有一些状态尽管是可达的，但是在功能上却与另一些状态等价，这样的自动机在设计和应用中显然很累赘，可以将一些无用的状态删掉，将另外一些等价状态进行整合和约简，使之状态数达到极小。

The pushdown automata described in this paper are more powerful than the existing finite automaton in computing theory.

计算理论表明，该种下推自动机的计算能力超过了已有的有限自动机。

In addition, a rule for translating a chop-automaton to a labelled finite state automaton is also defined.

同时，定义了一套转换规则把一个chop-自动机转换为一个标注有限状态自动机，使得它们接受相同的原子命题序列集。

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.

尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。

By means of the model, the extended finite automaton is converted into improved state charts, and then into multifunction views.

该模型对基本有限自动机进行了扩充；将扩充后的有限自动机转换成为改进状态图：根据改进状态图构造多功能视图；在此基础上进行软件开发。

For a big chunk of credit-card losses; the number of filings (and thus charge-off rates) would be rising again, whether

年美国个人破产法的一个改动使得破产登记急速下降，而后引起了信用卡大规模的亏损。

Eph. 4:23 And that you be renewed in the spirit of your mind

弗四23 而在你们心思的灵里得以更新