Minimization of (r,t) order memory quasi-linear finite automata
Deng Pei-min · Computer Engineering and Applications Journal · 2008
It is still a difficult problem at present to minimize(r,t) order memory quasi-linear finite automata.In this paper,authors consider how to recognize the minimization automata through zero state,and description of the minimal linear finite automata and some algorithms of the minimization of finite automata are given.