2 votes 2 votes A = { <M> | M is a DFA that accepts WR whenever it accepts W }. Then A is - a) Turing recognizable b) Turing unrecognizable c) decidable d) undecidable amrendra pal asked Aug 20, 2017 amrendra pal 256 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I am not sure, Take the dfa, reverse it.. Find the intersection of 2 dfa which will be a dfa..if there is a final state for the new dfa, then accept it else no.Thus decidable. correc me if i am worong Surabhi Kadur answered Aug 22, 2017 Surabhi Kadur comment Share Follow See all 2 Comments See all 2 2 Comments reply amrendra pal commented Aug 22, 2017 reply Follow Share language A is decidable . can you tell me the source of the answer 0 votes 0 votes Surabhi Kadur commented Aug 22, 2017 reply Follow Share That was my thought , as I mentioned before I'm not sure of answer .. 0 votes 0 votes Please log in or register to add a comment.