摘要
有穷自动机的化简是一个十分重要的问题,在等价的前提下,自动机的状态越少,意味着越节省软件和硬件资源。本文根据等价性原理,在等价类等概念的基础上,给出了确定型有穷自动机的最小化算法,并给出了该算法的程序实现。
The minimizing of the finite automata is very important, and taking equivalence as precondition, the fewer of the automaton＇s states mean that we can save more resources of the software and hardware. Using the principle of equivalence, we introduce the concept of the equivalence class and then give the minimizing algorithm of the deterministic finite automaton. At last, we accomplish the application of the algorithm.
出处
《山东电大学报》
2008年第1期16-17,20,共3页
Journal of Shandong TV University
关键词
自动机
等价关系
等价类
算法
finite automata
equivalence relation
equivalence class
algorithm
