Theory of Computation: How to practice ToC precisely ? Like I am unable to know transitions for intermediate states in dfa design , it takes time and sometimes I am unable to answer !! Ex – Σ ={a,b} design dfa for : 1.exactly 2a and 2b 2. Minimum 2a and minimum 2b In these thinking about intermediate transitions for possible acceptable strings takes time and sometimes i get wrong answer !!! So what to do to get exact accurate answer with min. Of states in such type of ques. ?