Register

TOC:- Turing Machines Decidiability

779 views
2 2 votes

Please help in classifying above languages

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · TOC DCFLNext → · TOC Countability
← Previous in category · TOC DCFLNext in category → · TOC Countability
Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
1.5k
1.5k views
rahul sharma 5 asked Aug 7, 2017
1,527 views
TOC Turing machines Decidability
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?L={⟨M⟩∣ M halts on all palindromes}.How can i use R...
1 1 vote
1 answers 1 answer
642
642 views
Abhipsa asked Jan 22, 2019
642 views
Turing Machines Theory
What is the difference between Turing Recognizable and Turing Decidable?Thanks!
1 1 vote
0 0 answers
754
754 views
rahul sharma 5 asked Aug 8, 2017
754 views
Turing Machines Deciadability
L ={ T | e(T) belongs to L(T) } , e(T) is the code for turing machine?The answer given is RE but not REC ,but cant we apply Rice theorem as follow-Tyes={Any machine accep...
2 2 votes
2 2 answers
1.1k
1.1k views
rahul sharma 5 asked Aug 7, 2017
1,100 views
Turing machines decidability
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?{⟨M1,M2⟩∣ M1 and M2 are two TMs, and ϵ∈L(M1)∖L(M2)}...