0 votes 0 votes Theory of Computation theory-of-computation regular-language finite-automata regular-expression + – jatinkumar asked Aug 12, 2018 jatinkumar 561 views answer comment Share Follow See 1 comment See all 1 1 comment reply MiNiPanda commented Aug 12, 2018 reply Follow Share I am giving you the transition table. Drawing DFA will be too unclear to understand. The states are written in the form of Q(na%3)(nb%3). Q00 is the initial state. On getting 1 a we go to Q10. Here the subscript has importance. It counts the mod value of a and b. When we give 1 a then na%3=1 and nb%3=0. Taking another example : Q20 is a state where na%3=2 and nb%3=0. On getting another a it goes to Q00 because now the no. of a's has increased by 1 and na%3=0. The states Qab with b>=a are the final states. a b ->*Q00 Q10 Q01 Q10 Q20 Q11 *Q01 Q11 Q02 Q20 Q00 Q21 *Q11 Q21 Q12 *Q02 Q12 Q00 Q21 Q01 Q22 *Q12 Q22 Q10 *Q22 Q02 Q20 Hopefully this table is okay.. 1 votes 1 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes If you make the final state to non final and non final states to final then it becomes FA of n(a) mod3>n(b) mod3. :) Verma Ashish answered Aug 12, 2018 • selected Aug 12, 2018 by jatinkumar Verma Ashish comment Share Follow See all 0 reply Please log in or register to add a comment.
