94 views
0
0 Comments

Construct a DFA to accept all strings which satisfy #(X)mod5=2

0
Anonymous 0 Comments

we will have 5 states because when divided by 5 we can have remainders from 0 to 4… and state with remainder 2 will be the final state..take strings as input from state with name 0 and divide them with 5 then the corresponding next state will be the one whose name  matches with the remainder.

You are viewing 1 out of 0 answers, click here to view all answers.