258 views
0 votes
0 votes
Find minimized finite automata which recognize 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

1 Answer

0 votes
0 votes

m1 contains 4 states and m2 contains 8 states.

Hope this helps.

Correct me if iam wrong.

No related questions found