Algebraic models for discrete systems' analysis (Q2770614)

The paper deals with algebraic models and methods to increase the effectivity of investigations of control systems in terms of finite automata and Boolean functions. The suggested models for finite automata are based on finite groups and result in establishing basic algebraic characteristics, developing a general scheme for estimating exponential lower bounds and in the design of nonstationary secret locks of arbitrary high complexity. It is also shown that Boolean vector-functions may be effectively identified in terms of vector spaces over \(GF(2)\).