Let 3V denote the set of all possible transfer function matrices of weakly invertible linear finite automata over a given finite field F. A classification and an enumeration on the infinite set are given.
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 cryptosyst...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展开更多
基金supported by the National Natural Science Foundation of China.
文摘Let 3V denote the set of all possible transfer function matrices of weakly invertible linear finite automata over a given finite field F. A classification and an enumeration on the infinite set are given.
文摘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
