On the Computational Power of Automata with Time or Space Bounded by Ackermann's or Superexponential Functions. - Ren-ji Tao (Theor. Comput. Sci., 1981)

Invertibility of Linear Finite Automata Over a Ring. - Ren-ji Tao (ICALP, 1988)

On Finite Automaton One-Key Cryptosystems. - Ren-ji Tao (FSE, 1993)

FAPKC3: A new finite automaton public key cryptosystem. - Ren-ji Tao; Shihua Chen; Xuemei Chen (J. Comput. Sci. Technol., 1997)

On Finite Automaton Public-Key Cryptosystem. - Ren-ji Tao; Shihua Chen (Theor. Comput. Sci., 1999)

Constructing Finite Automata with Invertibility by Transformation Method. - Ren-ji Tao; Shihua Chen (J. Comput. Sci. Technol., 2000)

Input-Trees of Finite Automata and Application to Cryptanalysis. - Ren-ji Tao; Shihua Chen (J. Comput. Sci. Technol., 2000)

Structure of Weakly Invertible Semi-Input-Memory Finite Automata with Delay 1. - Ren-ji Tao; Shihua Chen (J. Comput. Sci. Technol., 2002)

Structure of Weakly Invertible Semi-Input-Memory Finite Automata with Delay 2. - Ren-ji Tao; Shihua Chen (J. Comput. Sci. Technol., 2002)