SOME RESULTS ON COMPOSITION OF FINITE AUTOMATA
Yi Zhong · Journal of Guangxi Normal University · 2005
In the construction of cryptosystem of a pair of keys and cryptosystem which is based on identifcation,the composition of finite automata becomes a basic means.The article studies the paper the relation about weakly invertibility,strict delay step,linearity and weakly inverse between two finite automata and their composition.