in Theory of Computation retagged by
368 views
1 vote
1 vote

in Theory of Computation retagged by
by
368 views

4 Comments

see there is a small funda : (its a kind of shortcut u can say and works 101% correct)

if x-> y than we have two conditions :

if x is false y will always be false..

if y is true x will always be true..

0
0
N case 2 falls in 1st condition...thats why we are using forward algorithm...

Thanks I got it now.
0
0
yes :)
0
0

Please log in or register to answer this question.