Invertibility of finite automata with quasi-(h,k)-order memory
Yi Zhong · Computer Engineering and Applications Journal · 2009
The weakly revertible and the weakly inverse of finite automata with quasi-(h,k)-order memory with delay k or k+1 are researched in this paper.A sufficient and necessary condition is given that a given finite automata of quasi-(h,k)-order memory is a weakly invertible with delay k or k+1.A weakly inverse of finite automata with quasi-(h,k)-order memory with delay k or k+1 is easily made according to results above.