In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.
在语言理论，最简单的一类算法就是可以用有限自动机实理论可以算法现的算法，也是本书的主题。
2
The structure of feedforward inverse finite automata is a fundamental problem in the invertibility theoryof finite automata.
前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。
3
The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automatatheory.