371 views

1 Answer

3 votes
3 votes
D) L is REL

TM is not able to accept all the languages there are some languages which TM cannot accept

and REL is not closed under complementation

Related questions

2 votes
2 votes
2 answers
1
AnilGoudar asked Jul 17, 2017
687 views
If language L is countable infinite set then, L is Recursive as we can define enumeration method for the countable set.or It can Regular ??
4 votes
4 votes
1 answer
2
3 votes
3 votes
1 answer
3
0 votes
0 votes
1 answer
4
TusharKumar asked Jan 21, 2023
314 views
Consider L is recursive language and G is Recursively Enumerable then,L' union G is Recursively enumerable. Can someone please explain me this statement why it is true.?...