3 votes 3 votes a) L is decidable b) L is undecidable c) L is regular d) None of these Theory of Computation decidability context-free-language turing-machine reduction + – Nymeria asked Jan 10, 2018 Nymeria 936 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments Nymeria commented Jan 11, 2018 reply Follow Share @anu007 got it sir. thank you so much :) 1 votes 1 votes Soumya29 commented Jan 12, 2018 reply Follow Share @Anu007 Can we apply Rice theorem here? If yes. Then can we take it as L(Tyes)= 1(0^p)1(1^2p) (any CFL reducable to 0^p1^2p) and L(Tno)= sigma* ? 0 votes 0 votes reboot commented Jul 18, 2020 reply Follow Share Duplicate question: https://gateoverflow.in/76610/decidability 0 votes 0 votes Please log in or register to add a comment.
