Register

peter linz excercise 2.2

634 views
0 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 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


 

Voting & Accepting an answer helps improve the community
← Previous · B+ tree deletionNext → · theory of computatio...
← Previous in category · Theory of Computatio...Next in category → · theory of computatio...
Position:
Show:

Related questions

1 1 vote
2 answers 2 answers
1.9k
1.9k views
ANJALI SAWARKAR asked Jul 27, 2017
1,930 views
an introduction to formal languages (peter linz) chapter2..excercise ..7th (d)
L= {w: na(w) mod 3 >nb(w)mod 3}. how we will make dfa of this?
0 0 votes
2 2 answers
819
819 views
Sanjay Sharma asked Apr 26, 2017
819 views
peter linz excercise
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 1 vote
1 1 answer
823
823 views
Sanjay Sharma asked Apr 25, 2017
823 views
peter linz excercise
0 0 votes
0 0 answers
630
630 views
Sanjay Sharma asked Apr 15, 2017
630 views
Timothy excercise