 Equivalently, the multiply-add operations performed during component-wise matrix multiplication should be replaced by Boolean and-or operations, that is, so that one is working with a ring of characteristic 2.A well-known theorem states that, for each DFA, there is an equivalent NFA, and vice versa.This implies that the set of languages that can be recognized by DFA's and NFA's are the same; these are the regular languages.