2,156 views
1 votes
1 votes
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s.

How many states does the above DFA have? How many final states?

Please explain your answer.

Please log in or register to answer this question.

Related questions

3 votes
3 votes
2 answers
1
Sona Barman asked Jan 15, 2018
2,283 views
Self doubt:Is there any method to calculate number of states in dfa e.g."x mod y" type of question without drawing dfa?Because in Gate time is vital factor.
2 votes
2 votes
1 answer
2
rahul sharma 5 asked Nov 9, 2017
936 views
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
0 votes
0 votes
2 answers
3