1 1 vote The Boolean expression $Y=\overline{A} \;\overline{B}\; \overline{C} D+\overline{A} B C \overline{D}+A \overline{B}\; \overline{C} D+A B \overline{C}\; \overline{D}$ can be minimized to $Y=\overline{A}\; \overline{B}\; \overline{C} D+\overline{A} B \overline{C}+A \overline{C} D$ $Y=\overline{A}\; \overline{B}\; \overline{C} D+B C \overline{D}+A \overline{B} \;\overline{C} D$ $Y=\overline{A} B C \overline{D}+\overline{B}\; \overline{C} D+A \overline{B} \;\overline{C} D$ $Y=\overline{A} B C \overline{D}+\overline{B}\; \overline{C} D+A B \overline{C} \;\overline{D}$ Combinational Circuits gate2007-ec combinational-circuits boolean-algebra + – admin 296 views answer comment Share Follow Add Sync Questions Print 0 reply Please log in or register to add a comment.
