Weak invertibility of linear finite automata over rings——Classification and enumeration
戴宗铎, 叶顶锋 · 中国科学通报：英文版 · 1996
The weak invertibility problem of finite automata (FAs) has received continuous considerations. The weak invertibility theory has applications in cryptography, both conventional cryptosystems and public key cryptosystems. Given a finite commutative ring (?) with identity, it is known, that the weak invertibility of a linear finite automaton(LFA) over (?) depends only on its transfer function matrix. Let H be the set of all possible transfer function matrices which weakly invertible LFAs over (?) can have. Our main