0 votes 0 votes Which of the following languages are recursive? L1: { <M,k> | M is a turing machine and |{ w ∈ L(M) : w ∈ a*b* } | <=k} L2: { <M> | there exists a turing machine M’ such that <M> ≠ <M’> and L(M) = L(M’) Theory of Computation made-easy-test-series turing-machine recursive-and-recursively-enumerable-languages + – Sambhrant Maurya asked Jan 9, 2019 • edited Mar 3, 2019 by Rishi yadav Sambhrant Maurya 245 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
