0 votes 0 votes A recursive language is empty or a recursive language contains all strings over sigma*. Why this problem is undecidable? Theory of Computation decidability theory-of-computation turing-machine recursive-and-recursively-enumerable-languages + – aditi19 asked Oct 29, 2018 aditi19 250 views answer comment Share Follow See 1 comment See all 1 1 comment reply akash.dinkar12 commented Oct 29, 2018 reply Follow Share https://math.stackexchange.com/questions/1643460/emptiness-and-infiniteness-decidable-for-recursive-languages 0 votes 0 votes Please log in or register to add a comment.
