1. F. Bao, “Limited error-propagation, self-synchronization and finite input memory FPSMs as weak inverses”, in Advances in Chinese Computer Science, Vol. 3, World Scientific, Singapore, 1991, pp. 1–24.
2. F. Bao, Y. Igarashi, “A randomized algorithm to finite automata public key cryptosystem”, in Proc. of ISAAC'94, LNCS 834, Springer-Verlag, 1994, pp. 678–686.
3. F. Bao, Y. Igarashi, X. Yu, “Some results on the decomposability of weakly invertible finite automata”, IPSJ Technical Report, 94-AL, November, 1994, pp. 17–24.
4. E. Berlekamp, “Factoring polynomials over large finite field”, Math. Comp. Vol. 24, 1970, pp. 713–735.
5. S. Chen, “On the structure of finite automata of which M' is an (weak) inverse with delay Τ”, J. of Computer Science and Technology, Vol. 1, No. 2, 1986, pp. 54–59.