title: How many minimized DFA's possible?
body: <p>How many minimized DFA's are possible with states {A,B} over alphabet={a,b}? I have worked out this question and obtained 122 as answer. I took two cases 
  1. Minimal DFA with 2 states
  2. Minimal DFA with 1 state</p>
  
  <p>In case 1 all 4 cases of A and B that is each of being final, one final and one non-final and both non-final. So total is 120</p>
  
  <p>In case 2 two single state DFA's.</p>
  
  <p>Hope my problem is clear. Is this the correct answer. If no, answer with explanation is appreciated.</p>