Intuitionistic fuzzy finite automata theory is an important part of automata theory.
直觉模糊自动机理论是自动机理论的一个重要分支。
In language theory, the simplest algorithms are those which can be implemented by finite automata, the subject of this algorithm implement simplest book.
在语言理论，最简单的一类算法就是可以用有限自动机实理论可以算法现的算法，也是本书的主题。
The structure of feedforward inverse finite automata is a fundamental problem in the invertibility theory of finite automata.
前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。
应用推荐