261 views
1 votes
1 votes
divisibility: |w| i.e length of string is divisible by a,b.

If a doesn't divide b and b doesn't divide a then Min. states = a*b

Case 1 : Divisible by a and b ----> If a divides b or b divides a then Min. No .of states = LCM(a,b)  
Case 2: Divisible by a or b  ------> If a divides b or b divides a then Min. states =  GCD(a,b)

Doubt -> is these all cases are true always ?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
ishitasinha asked Jan 10, 2019
266 views
for directed weighted graph with edge weight non negative whether dijakstra will give correct result in every case ???
0 votes
0 votes
1 answer
4
Akash Kumar Roy asked May 2, 2018
378 views
E= V2If we apply log both side. What will be the result with respect to V. V=?