A NOTE ON COMPOUND FINITE AUTOMATA
Hao Wang · Journal of Computer Research and Development · 1997
The compound M=C′(M 1,M 0) of finite automata M 1 and M 0 plays a fundamental role in the design of finite automaton public key cryptosystem. Under certain conditions, a generalized linear R aR b transformation for M 1 can deduce a generalized linear R aR b transformation for M. It is demonstrated that such conditions are unnecessary, and that a linear R aR b transformation for M 1 can deduce a linear R aR b transformation for M.