PROLOG language is selected in order to realize the automaton representation of model in computer.
为了在计算机中实现模型的自动机表示，选用了PROLOG语言。
Based on the formal language and automaton theory, this paper mainly studies the automatic recognition of steel character symbol.
本文基于形式语言与自动机理论，主要对钢筋标识串的自动识别进行了研究。
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 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.
从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集，同时讨论了正则语言的可递归性。
应用推荐