0 votes 0 votes D is dfa is L(D) recursive enumerable?? (decidable/undecidable) Theory of Computation theory-of-computation + – focus _GATE asked Dec 28, 2016 focus _GATE 263 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Pavan Kumar Munnam commented Dec 28, 2016 reply Follow Share L(D) is regular that is trivial if D is a dfa, so it is decidable 2 votes 2 votes Surajit commented Dec 29, 2016 reply Follow Share if we use DFA we can decide L(D) if we use suppose TM we cannot,it will accept but it cannot decide whether the language is Regular. 0 votes 0 votes Please log in or register to add a comment.
