edited by
1,586 views

3 Answers

Best answer
19 votes
19 votes

The functionally complete set is by which you can perform all operations. So, if any logical set is able to implement the operation {And , NOT}  or {OR, NOT}; it is known as functionally complete.

Now come to NOR gate.

  • $A$(NOR)$B= (A+B)'$
  • $A$(NOR)$A =(A+A)' =(A)'$ , so we can perform the NOT operation .
  • $(A+B)'$ NOR $(A+B)' =((A+B)' + (A+B)')'=((A+B)')' =(A+B) $, so OR operation is also performed successfully .

So, NOR is functionally complete.

edited by

Related questions

17 votes
17 votes
3 answers
1
makhdoom ghaya asked Nov 27, 2016
5,368 views
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR parser.
9 votes
9 votes
1 answer
2
11 votes
11 votes
2 answers
3
makhdoom ghaya asked Nov 30, 2016
2,909 views
Explain the behaviour of the following logic circuit with level input $A$ and output $B$.