For EX-NOR of 2 boolean variable if we simply replace the variables with their complement , the value remains same .
F = a.b + a’.b’ – > replace a with a’ and b with b’ – > a’.b’ + ab
We will be using this theory here . Now , look at the 3 XNOR gates from right . If we simply imagine that the ‘NOT’ from first 2 XNOR and is taken and made as a NOT gate to the inputs of the final XNOR gate then the final XNOR doesn’t change and the other 2 XNOR becomes XOR .
then the boolean formula becomes something like ,
XNOR(XOR(x,XNOR(x,y)), XOR(y,XNOR(x,y)))
= NOT(XOR(XOR(x,XNOR(x,y)) , XOR(y,XNOR(x,y))))
= NOT(XOR(x,XOR(x,y),y,XOR(x,y)))
= XNOR(x,y)