1 votes 1 votes Theory of Computation decidablity ace-test-series + – shabnam asked Sep 16, 2018 • retagged Jul 10, 2019 by Cristine shabnam 362 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments arvin commented Sep 16, 2018 reply Follow Share 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 votes 0 votes shabnam commented Sep 16, 2018 reply Follow Share N case 2 falls in 1st condition...thats why we are using forward algorithm... Thanks I got it now. 0 votes 0 votes arvin commented Sep 16, 2018 reply Follow Share yes :) 0 votes 0 votes Please log in or register to add a comment.