edited by
2,456 views
1 votes
1 votes

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.

edited by

1 Answer

Best answer
9 votes
9 votes
selected by

Related questions

0 votes
0 votes
2 answers
1
aditi19 asked Dec 14, 2018
1,546 views
Given following NFAfind the minimal equivalent DFA
1 votes
1 votes
0 answers
2
sripo asked Oct 17, 2018
1,357 views
What is the difference between a dfa accepting epsilon moves and dfa accepting nothing?I have a dfa which has no states what will be the dfa this is regarding,this questi...
0 votes
0 votes
0 answers
3
Harshitha 123 asked Jun 12, 2018
414 views
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
1 votes
1 votes
1 answer
4
kislaya Pant asked May 8, 2018
1,108 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....