相关期刊:《Computer Systems Science & Engineering》《Advances in Linear Algebra & Matrix Theory》《Journal of Computer Science & Technology》《Applied Mathematics》更多>>
FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’s public key would not be restricted to memory finite automata. The generalized FAPKC...
Holub proved that any bounded linear operator T or -T defined on Banach space L 1(μ) satisfies Daugavet equation1+‖T‖=Max{‖I+T‖, ‖I-T‖}.Holub’s theorem is generalized to the nonlinear case: any nonlinear Lipsc...
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...
Definition. Let M*= be a finite automaton. M* is said to be a c-order semi-input-memory finite automaton if there exists an autonomous finite automaton M'= and a single-valued map...