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.
前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题。
The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science.
有限自动机理论是一类简单类算法的数学理论，这些算法理论这些数学虽然简单但对计算机科学很重要。
By analyzing the theory of Deterministic Finite Automata (DFA) and ARS, a DFA model based on animal character is established.
通过对有穷自动机理论与动物识别系统进行分析，建立了一个基于动物特征的确定型有穷自动机的模型。
The paper models queue system using queuing theory, finite state machine principle, and cellular automata model.
本文利用排队论、有限状态自动机原理以及元胞自动机模型对排队系统进行建模。
The paper models queue system using queuing theory, finite state machine principle, and cellular automata model.
本文利用排队论、有限状态自动机原理以及元胞自动机模型对排队系统进行建模。
应用推荐