Identification of boolean functions by methods of linear algebra

Algebraic models for disrete systems' analysis

“…To reduce the complexity it is natural to replace searching by algebraic operations wherever it is possible. This problem was solved in [7]. The main idea of the suggested approach is to explore the fact that {0, 1} m+n is the vector space GF m+n (2).…”

“…Theorem 10 [7]. The set graph(f ) (f ∈ P m,n ) is a subspace of the space GF m+n (2) if and only if f ∈ (T 0 (m) ∩ L(m)) n .…”

“…Theorem 11 [7]. lin graph(f ) = ∅ (f ∈ P m,n ) if and only if f ∈ T Theorem 12 [7]. For any f ∈ T Theorem 13 [7].…”

“…lin graph(f ) = ∅ (f ∈ P m,n ) if and only if f ∈ T Theorem 12 [7]. For any f ∈ T Theorem 13 [7]. For any f ∈ T Theorem 13 implies that the investigated problem may be solved via applying the following algorithm…”