How many DFA’s exits with two states over input alphabet {0,1} ?
A. 16
B. 26
C. 32
D. 64
Answer:A
How many DFA’s exits with two states over input alphabet {0,1} ?
A. 16 B. 26 C. 32 D. 64
Explanation: Number of DFA’s = 2^n * n^(2*n).