2 2 votes The Boolean expression $F(X,Y,Z) = \overline{X} \: Y \: \overline{Z}+ X \: \overline{Y} \: \overline{Z}+ X \: Y \: \overline{Z} + X \: Y \: Z$ converted into the canonical product of sum (POS) form is $(X+Y+Z)(X+Y+\overline{Z})(X+\overline{Y}+\overline{Z})(\overline{X} + Y + \overline{Z})$ $(X+\overline{Y}+Z)(\overline{X}+Y+\overline{Z})(\overline{X}+\overline{Y}+Z)(\overline{X} + \overline{Y} + \overline{Z})$ $(X+Y+Z)(\overline{X}+Y+\overline{Z})(X+\overline{Y}+Z)(\overline{X} + \overline{Y} + \overline{Z})$ $(X+\overline{Y}+\overline{Z})(\overline{X}+Y+Z)(\overline{X}+\overline{Y}+Z)(X + Y + Z)$ Digital Circuits gate2015-ec-1 boolean-algebra digital-circuits + – Milicevic3306 533 views answer comment Share Follow Add Sync Questions Print See 1 comment 1 1 comment reply Deepak Poonia commented Jun 6, 2024 reply Follow flag Watch This: Conversion of "Sum of Minterms" to "Product of Maxterms" 0 0 replyShare Please log in or register to add a comment.