Question

Construct a DFA accepting all string w over {0,1} such that the number of 1's in w is 3 mod 4

Answer 1

Answer:

Input: a a b b b

Output: NOT ACCEPTED

// n = 2, m=3 (2 mod 3! = 3 mod 3)

Input: a a b b

Output: ACCEPTED

// n = 2, m = 2 (2 mod 3 = 2 mod 3)

Input: b b b

Output: NOT ACCEPTED

// n = 0, m = 3 ((0 mod 3 = 3 mod 3) <=> (0=0))

hope it helps you.....✌✌

Answer 2

Answer:

dfa accepting all string w over {0,1} such that the number of 1's in w is 3 mod 4