in Theory of Computation edited by
2,426 views
1 vote
1 vote

1.The minimum no of state in DFA  that accept L={an| n is multiple of 3 but not 5}    Ans  15 

i did it and found that 3,5 relatively prime so 3*5=15

2.The minimum no of state in DFA  that accept L={an| n is multiple of 2 but not 4}    Ans 4 and done and 

found that 2,4 not relatively prime so max(2,4) =4 Can't a Conclude it???

 

 

 

Edited. thanks for rectification.

in Theory of Computation edited by
2.4k views

4 Comments

Check this

0
0
yes, the solution provided by them is absolutely right ( Thanks for Correcting me ) ,

i mistaken, in that q15 and q0 are equal states.

But they surely mistaken in the second problem, which is also 4 only instead of 5.
0
0
Yes, the second problem requires 4 states, I tried it.
0
0

1 Answer

9 votes
9 votes
Best answer
selected by

4 Comments

check this,

is there anything wrong ?

0
0

Shaik Masthan bro diagram is correct . i am just saying that in your pic just read 2nd last line u write lcm  (2,4) - max (2,4)

0
0
edited by
brother it is equal(=) symbol but not minus(-) symbol,

LCM(2,4) = MAX(2,4)

Btw i updated the answer, check it
0
0

Related questions