Algebraic models for discrete systems' analysis
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)\).
- Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces
- Information authentication in automated control systems based on finite groups with multidimensional cyclicity
- An algebraic model of synchronous systems
- Algebras of stepping motor programs
- scientific article; zbMATH DE number 3943038 (Why is no real title available?)
- scientific article; zbMATH DE number 728197 (Why is no real title available?)
- scientific article; zbMATH DE number 1911985 (Why is no real title available?)
- Machine resolving of discrete mathematics problems
- Analysis of automata-algebraic models
This page was built for publication: Algebraic models for discrete systems' analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770614)