Decomposition of weakly invertible quasi-(r,r)-order memory linear finite automata
Yi Zhong · Computer Engineering and Applications Journal · 2007
This paper studies the output weight of the weakly invertible quasi-(r,r)-order memory linear finite automata,then gives a fact that the r-output weight of any given states of the weakly invertible quasi-(r,r)-order memory linear finite automata is 1.For a n-ary quasi-(r,r)-order memory linea finite automata M,whether M is weakly invertible with delay r,a necessary and sufficient condition is obtained,that M can be decomposed into a weakly invertible finite automata M0 with delay 0 and a weakly invertible quasi-(0,r)-order memory linear finite automata M1 with delay r.