 In other words, a language is the set of strings which, when applied to the circuits corresponding to their lengths, evaluate to 1.Several important complexity measures can be defined on Boolean circuits, including circuit depth, circuit size, and number of alternations between AND gates and OR gates.For example, the size complexity of a Boolean circuit is the number of gates.