The theory of finite automata is the mathematical theory of a simple class of algorithms that are important in computer science. 有限自动机(FA)理论是一类简单类算法的数学理论,这些算法理论这些数学虽然简单但对计算机科学很重要。
Some Studies on Fuzzy Finite Automata(FA) 关于模糊有限自动机(FA)若干问题的研究
Equivalence of Fuzzy Finite Automata(FA) Based on Computing with Words 基于词计算的Fuzzy有限自动机(FA)的等价问题
Discussion of Finite Automata(FA) Based on Algebraic Theory of Semirings 基于半环代数理论的有限自动机(FA)的探讨
Finite Automata(FA) Minimization Based on Equivalence Relation 基于等价关系的有穷自动机最小化方法