3 votes 3 votes A) Decidable REC B) Undecidable and RE C) Undecidable and non RE D) Decidable but RE Theory of Computation turing-machine recursive-and-recursively-enumerable-languages + – yankur9 asked Jan 13, 2018 yankur9 353 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply hs_yadav commented Jan 13, 2018 reply Follow Share B is the answer ? please varify 0 votes 0 votes Pawan Kumar 2 commented Jan 13, 2018 reply Follow Share https://gatecse.in/grammar-decidable-and-undecidable-problems/ 0 votes 0 votes yankur9 commented Jan 14, 2018 reply Follow Share how ? will u please elaborate? 0 votes 0 votes Please log in or register to add a comment.
