544 views
0 votes
0 votes
L={TM | TM accepts only '11'}

A.Is this language an REL?

B. Is the complement of L REL or not REL? If REL is it Decidable or Semidecidable?

I think there is no logic to reject other string apart from '11', hence we cannot show in output all valid inputs so I think L is not REL please somebody verify.

But i have doubt in complement of this language is it REL or not REL?

Thanks

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
Sparsh-NJ asked Aug 6, 2023
219 views
If G is a CFG then L(G) = (Sigma)* is Decidable or Undecidable?The reference where I solved this question says this is an Undecidable problem! But I think it's Decidable ...