EQUIVALENCE PROBLEM FOR DETERMINISTIC (k, m)-SHIFT-REGISTERS

The deterministic (k1...km)-nets of the parallel controlled shiftregisters

“…The class DNPCRfc1)...)fcm contains all the classes of parallel as well as of sequential nets which have been considered before (for example see [9], [11], [15] and [3], [5], [7], [8], [13], [14], [17], respectively), (2) some subclasses of the class DNPCRfcj generate periodic sequences of states with the long periods-(such sequences can be used in cryptology), (3) our nets could be the models for integrated circuits, (4) parallel (ki,..., fcm)-nets could often be used for the realization of parallel iterative algorithms, (5) a slight modification of the (k\,..., A;m)-nets allows to obtain a model for the operational researches.…”