| 1. | Any finite sequence of symbols from an alphabet a is called a string .
由字母表A中的符号所组成的任何有穷序列，被称为符号串。 |
| 2. | One, akin to nominalism and idealism, finds its expression today in finitism and intuitionism .
一种类似于唯名论和观念说，现在称为有穷论和直觉主义。 |
| 3. | A property of finite arithmetic sequences and its application
关于有穷等差数列的一个性质 |
| 4. | The derivate of the function with finite limit at the infinite point
在无穷远处有有穷极限的函数的导数 |
| 5. | The drive was invented following research into finite improbability
这种推进方法的发明得益于对有穷概率的研究 |
| 6. | Finite state machine minimization
有穷自动机简化 |
| 7. | Any finite sequence of symbols from an alphabet a is called a string
由字母表a中的符号所组成的任何有穷序列，被称为符号串。 |
| 8. | So the storage structure of finite automaton should the choosed adjacency lists
所以，有穷自动机的存储结构最好采用邻接链表来存储。 |
| 9. | 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
摘要尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。 |
| 10. | The model dmswf focuses on procedure definition with a certain subject , procedure modeling based on finite automation and resource model figured as logic tree
其中包括具有主题意义的过程定义、基于有穷状态机的过程建模以及逻辑树表示的资源模型等。 |
