有穷自动机，一种计算能力极其有限的计算模型，具有解决素性测试的能力通过构造法得到了证明。
Finite automaton, a computational model of extremely limited computing ability, was proved to have the capability of solving primeness test by construction.
基于局部作用原理，借用有限元离散和插值技术，引入元胞自动机的演化思路，得到一种新的力学计算方法——元胞单元法。
Based on principle of local action and the idea of cellular automata, a new mechanical method cellular element method is presented through inducting the discrete techniques of finite element method.
该方法适宜于计算机编程操作，因此可方便地用于多输入多状态有限自动机的综合。
The method fit for the program operation of the computer can be easily used for the synthesis of a finite automation with multi-input and multi-state.
有限自动机理论是一类简单类算法的数学理论，这些算法理论这些数学虽然简单但对计算机科学很重要。
The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.
摘要：使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。
Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.
“因他们的合著论文“有限自动机与其判定性问题”。”论文中引入了非确定自动机的概念，被证明是(计算理论科学研究中的)一个非常重要的概念。
For their joint paper "Finite Automata and their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept.
“因他们的合著论文“有限自动机与其判定性问题”。”论文中引入了非确定自动机的概念，被证明是(计算理论科学研究中的)一个非常重要的概念。
For their joint paper "Finite Automata and their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept.
应用推荐