retagged by
567 views
2 votes
2 votes
plzz expalin in detail
Which of the following language is recursively enumerable language?

1.{< M > ⎪ M is a TM and there exist an input whose length is less than 100, on which M halts}
2.{< M > ⎪ M is a TM and L(M) = {00, 11}}
3.{M1, M2, M3 ⎪ L(M1) = L(M2) ∪ L(M3)}
4.All of these
retagged by

Related questions

3 votes
3 votes
1 answer
1
3 votes
3 votes
2 answers
2
3 votes
3 votes
2 answers
3