toc minimal dfa

Question

. Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the following. L1:L2 is a language, which contains a set of strings which produces a remainder ‘1’, when its equivalent value is divisible by ‘4’. L2:L1 is a language it contains a set of strings which are starting with 1010 and the length of the string is divisible by 4. (a) m1 contains 4 states and m2 contains 7 states (b) m1 contains 4 states and m2 contains 8 states (c) m1 contains 3 states and m2 contains 9 states (d) m1 contains 4 states and m2 contains 9 states
 

Answer 1

So option (C) is correct.

Comments

ans is c
as on minimising m1 we get 3 states

---

YES , I forgot to minimize it . State q0 and q2 are equivalent.
so total states for m1 is = 3

---

I edited the answer , Now have a look .

---

remainder ‘1’, when its equivalent value is divisible by ‘4’  how did u draw m1 plz explain in detail

100 is divisible by 4 but it does not move to final state

it is dfa how will u get remainder what does q1 in u r ans indicate plzexplain