Before revision: While the number of levels here is 3, the total number of product terms and literals reduce because of the sharing of the term B + C. Similarly, we distinguish between sequential and combinational circuits , whose behavior can be described in terms of finite-state machine state tables/diagrams or by Boolean functions and relations respectively .
After revision: While the number of levels here is 3, the total number of product terms and literals reduce because of the sharing of the term B + C. Similarly, we distinguish between combinational circuits and sequential circuits .