Register

turing machine

733 views
0 votes
0 votes
What is the union of recursive and recursive enumerable language?
User Avatar

2 Answers

0 votes
0 votes
Recursively enumerable  as every  recursive language is recursively enumerable but vice-versa isn't true.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

118
views
0 answers
0 votes
RahulVerma3 asked Apr 2
118 views
Theory of Computation | design of Turing Machine
Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape
User Avatar
168
views
0 answers
1 votes
rajveer43 asked Dec 2, 2023
168 views
Turing machines question(Turing machine for time travelling
Imagine a Turing machine that needs to determine whether a computation will halt or continue when provided with a specific input. However, there's a twist: ... it is interesting whether it is possible to design the turing machine or not?
User Avatar
308
views
0 answers
0 votes
Picturesque asked Oct 31, 2023
308 views
Turing machine for a^n b^m c^n d^m NET UGC December 2022
The state diagram for the initial part of this turing machine given as:Here, we are basically traversing through the input tape, changing occurence of 'a' to X1, ... and directly looping back to 'q0' Please shed some light on it, thanks!
User Avatar
848
views
2 answers
3 votes
h4kr asked Dec 7, 2022
848 views
Turing machine question
I saw question where I saw this format being used:L1 = {<M> | L(M) = ϕ}What does exactly <M> mean and why is L(M) = ϕ, mentioned afterwards. ... ? If the language is equivalent to null, it contains nothing. Then what does it exactly mean?
User Avatar
Link Copied!