<em>A</em><em> </em><em> </em><em>WAn</em><em> </em><em>(</em><em> </em><em>Wide</em><em> </em><em>Area</em><em> </em><em>Network</em><em> </em><em>)</em><em> </em><em>is</em><em> </em><em>made</em><em> </em><em>up</em><em> </em><em>of</em><em> </em><em>LANS</em><em> </em><em>(</em><em> </em><em>Local</em><em> </em><em>Area</em><em> </em><em>Network</em><em>)</em><em>…</em><em>…</em><em>…</em><em>…</em>
Answer: True
Explanation:
Yes, the given statement is true that a DFA is equivalent to NFA in terms of power. For any type of NFA we can easily build an equal DFA so, the NFA are not much powerful as compared to DFA. Both NFA and DFA are characterized by a similar type of class.
DFA is a special case of NFA and They both defined in the same class of language. Each condition in the DFA get summarized by all the condition that the NFA has itself.
How efficient well if we are transmitting 6bits and we need 10 to transmit the 6 bits that would be 6/10 = .6 = 60% efficient.
