retagged by
4,758 views
2 votes
2 votes

Construct minimal  DFA for L = {an: n is either a multiple of three or a multiple of 5 }

retagged by

3 Answers

5 votes
5 votes

In minimized dfa 15 states will be present, because lcm(3,5)=15 so loop should be of 15.

1 votes
1 votes

DFA with 16 states.

Note: I think it can be minimised. I have done by constructing NFA and then converting NFA to DFA.

Related questions