339 views
0 votes
0 votes
draw the DFA

Show that the language L= {an: n is either a multiple of three or a multiple of 5} is regular.

1 Answer

2 votes
2 votes

DFA for multiple of Three

DFA for multiple of Five


Combine above DFAs and then make all states final expect for {00, 01, 02, 10, 20, 30, 40} as in these states either multiple of 3 or five is accepted


 

Related questions

1 votes
1 votes
2 answers
1
ANJALI SAWARKAR asked Jul 27, 2017
953 views
L= {w: na(w) mod 3 >nb(w)mod 3}. how we will make dfa of this?
0 votes
0 votes
2 answers
2
Sanjay Sharma asked Apr 26, 2017
367 views
Which of the following languages are regular1)L= wwR v : v,w belongs to {a,b}+2)L=uwwR v : u,v,w belongs to {a,b}+ 3)L=uwwR v : u,v,w belongs to {a,b}+ .|...
1 votes
1 votes
1 answer
3
Sanjay Sharma asked Apr 25, 2017
331 views
0 votes
0 votes
0 answers
4