0 votes 0 votes Decidability of M is a TM and L(M) is a regular language ? Theory of Computation decidability theory-of-computation turing-machine + – Neal Caffery asked Dec 1, 2016 Neal Caffery 406 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes i m sorry i was very bad to explain my view at 1st attempt but here this might help u to understand why it is like that... https://gateoverflow.in/90870/me-flt-4-q-51 S Ram answered Dec 1, 2016 • edited Dec 29, 2016 by S Ram S Ram comment Share Follow See all 2 Comments See all 2 2 Comments reply SeemaTanwar commented Dec 29, 2016 reply Follow Share But ww^r is not a regular language. Every reg language is R.E. So how can we say that we cant design a turing machine for every reg language? And also in reg language we can judge the membership of any input so it must be decidable. If I am wrong please do correct me. @Arjun sir please clear out the confusion 0 votes 0 votes S Ram commented Dec 29, 2016 reply Follow Share edited check now.. 0 votes 0 votes Please log in or register to add a comment.
