While the number of levels here is 3, the total number of product terms and literals reduce {{Quantify|date=February 2010}} because of the sharing of the term B + C.
Similarly, we distinguish between [[SequentialCombinational logic|sequentialcombinational circuits]] and [[CombinationalSequential logic|combinationalsequential circuits]],. whoseCombinational behaviorcircuits produce their outputs based only on the current inputs. They can be describedrepresented inby terms ofboolean [[finite-stateRelation machine(mathematics)|relations]]. stateSome tables/diagramsexamples orare by[[priority Booleanencoder]]s, functions[[binary anddecoder]]s, relations[[multiplexer]]s, respectively[[demultiplexer]]s.
Combinational circuits are defined as the time independent circuits which do not depends upon previous inputs to generate any output are termed as combinational circuits. Examples – [[Priority encoder]], [[Binary decoder]], [[Multiplexer]], [[Demultiplexer]].
Sequential circuits areproduce thosetheir which areoutput dependentbased on clockboth cyclescurrent and dependspast inputs, depending on presenta asclock wellsignal asto pastdistinguish the previous inputs tofrom generatethe anycurrent outputinputs. ExamplesThey –can [[Flip-flops]],be represented by finite [[Counterstate (digital)|Counters]]machines.
Some examples are [[Flip-flop (electronics)|flip-flops]] and [[Counter (digital)|counters]].
