From the logic diagram: Gate 1 is a NAND gate with inputs A and B, giving output (1) = $(A.B)'$. Gate 2 is an AND gate with inputs B' and C, giving output (2) = $B'.C$. Gate 3 is an OR gate combining (1) and (2), giving output (3) = $(A.B)' + B'.C$. The final gate is a NOT gate acting on (3), giving output $X = [(A.B)' + B'.C]'$.
Truth table: