retagged by
311 views
0 votes
0 votes
closed as a duplicate of: L= {<TM> | TM halts on every input}

L = { <M> / M is a Turing machine and M accepts a regular language }.

This Language L is recursively enumerable but not recursive. ...right ??

retagged by

Related questions

1 votes
1 votes
1 answer
2
Ayan21 asked Dec 17, 2018
586 views
Does the statement given below is true?If a language L is recursive enumerable than there does not exits a TM that could accept complement of L but reject L.
0 votes
0 votes
1 answer
4
vignesh asked Apr 21, 2017
334 views
This language,L = { <M,w / M is a TM,w is a string and M does not halt on string w }is not recursively enumerable ...right ???