GRAFCET是工业自动机的专用编程语言(Arzul在他的帖子中给出了细节)。
GRAFCET is a programming language dedicated to industrial automata (Arzul gives details in his post).
在语言理论，最简单的一类算法就是可以用有限自动机实理论可以算法现的算法，也是本书的主题。
In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.
本系列文章应用形式语言及自动机理论技术，系统地探讨了DNA分子的可计算性及其计算能力。
The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.
结果表明：用有限自动机就可以接收该极限语言。
The result shows that the finite automaton can accept this limit set.
本文提出了时间树自动机识别语言的一个条件，并证明了结论的正确性。
This paper proposes a condition of timed tree automata recognizing language, proves the correctness of its.
为了在计算机中实现模型的自动机表示，选用了PROLOG语言。
PROLOG language is selected in order to realize the automaton representation of model in computer.
该文根据自动机的定义，对超级自动机作了特定的定义，并给出了自动机对语言的识别功能的具体步骤。
Finally, its function of identifying language and solving logic problems is discussed by a special example based on the definition of super automata.
下推格值自动机以终态与以空栈两种接受词语言的方式是等价的。
The equivalence of acceptance words by PDLA with final state and with empty stack is proved.
本文基于形式语言与自动机理论，主要对钢筋标识串的自动识别进行了研究。
Based on the formal language and automaton theory, this paper mainly studies the automatic recognition of steel character symbol.
算法，语言，自动机和编译器：一种实用方法。
Algorithms, Languages, Automata, and Compilers: a Practical Approach.
从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集，同时讨论了正则语言的可递归性。
The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regular language was analyzed.
有三个核心领域：形式语言与自动机理论、可计算性理论和计算的复杂性理论。
The three main research areas of the theory are: formal language and automata theory, computability theory and the computing complexity theory.
用时间自动机验证一个有穷状态实时系统的正确性，可归结为判定两个时间正则语言的包含问题，亦可归结为判定两个时间正则语言的交是否为空的问题。
To verify the correctness of the finite state real time system by timed automaton can come down to the inclusion of two timed regular languages.
下推格值自动机接受的词语言与上下文无关格值文法生成的词语言具有等价关系。
The equivalence of words language accepted by PDLA and generated by CFLG is proved.
文中首先通过在分子有限自动机上扩展一个分子下推存储器从而获得了一种简单的分子下推自动机，并基于该下推自动机提出了一类语言的分子自动机解法。
In this paper, a simple biomolecular pushdown automaton is constructed with a finite automaton and a pushdown store firstly, and an algorithm is designed to solve a kind of languages.
文中首先通过在分子有限自动机上扩展一个分子下推存储器从而获得了一种简单的分子下推自动机，并基于该下推自动机提出了一类语言的分子自动机解法。
In this paper, a simple biomolecular pushdown automaton is constructed with a finite automaton and a pushdown store firstly, and an algorithm is designed to solve a kind of languages.
应用推荐