Weak invertibility of linear finite automata over rings——Classification and enumeration

作     者：戴宗铎 叶顶锋 

作者机构：State Key Lab. of Info. Security Department of Mathematics Chinese Academy of Sciences Beijing 100039 China 

出 版 物：《Chinese Science Bulletin》 (中国科学通报)

年 卷 期：1996年第41卷第3期

页      面：190-196页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：National Natural Science Foundation of China 

主　　题：linear finite automaton weak invertibility transfer function matrix. 

摘      要：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