If L is a recursive language, L’ is:(a) Recursive(b) Recursively Ennumerable(c) Both (a) and (b)(d) None of the mentionedThis question was addressed to me during an interview for a job.My question is taken from The Language of Turing Machine-2 in section Introduction to Turing Machines of Automata Theory

If L is a recursive language, L’ is:(a) Recursive(b) Recursively Enn

1.	If L is a recursive language, L’ is:(a) Recursive(b) Recursively Ennumerable(c) Both (a) and (b)(d) None of the mentionedThis question was addressed to me during an interview for a job.My question is taken from The Language of Turing Machine-2 in section Introduction to Turing Machines of Automata Theory
Answer» The CORRECT choice is (c) Both (a) and (b) To explain I would say: If T is a TURING machine recognizing L, we can MAKE it recognize L’ by interchanging the two outputs. And EVERY recursive language is recursively ennumerable.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following parameters cannot be used to restrict a turing machine?(a) tape alphabets(b) number of tapes(c) number of states(d) none of theseThis question was posed to me in exam.This key question is from Multistack Machines, Counter Machines topic in portion Introduction to Turing Machines of Automata Theory
Which of the following does not exists?(a) Mutitape TM(b) Multihead TM(c) Multidimentional TM(d) None of the mentionedThe question was asked by my college director while I was bunking the class.This interesting question is from Non Deterministic Turing Machines in portion Introduction to Turing Machines of Automata Theory
RASP stands for:(a) Random access storage program(b) Random access stored program(c) Randomly accessed stored program(d) Random access storage programmingThis question was addressed to me by my school principal while I was bunking the class.My query is from The Language of Turing Machine in chapter Introduction to Turing Machines of Automata Theory
Which of the problems are unsolvable?(a) Halting problem(b) Boolean Satisfiability problem(c) Both (a) and (b)(d) None of the mentionedThe question was asked in an interview for internship.The doubt is from The Language of Turing Machine in portion Introduction to Turing Machines of Automata Theory
‘a’ in a-machine is :(a) Alan(b) arbitrary(c) automatic(d) None of the mentionedThis question was posed to me during an internship interview.I'm obligated to ask this question of Turing Machine-Notation and Transition Diagrams in chapter Introduction to Turing Machines of Automata Theory
Instantaneous description of a counter machine can be described using:(a) the input tape contents(b) position of the input head(c) distance of storage heads from symbol Z(d) all of the mentionedThis question was posed to me during a job interview.This interesting question is from Multistack Machines, Counter Machines in section Introduction to Turing Machines of Automata Theory
Which of the following is true with reference to semi-infinite tape using a two track tape?(a) Can simulate a two way tape(b) Upper track represents the head-right cells(c) Lower track represents the head-left cells(d) All of the mentionedI got this question in examination.Asked question is from Multistack Machines, Counter Machines in section Introduction to Turing Machines of Automata Theory
A turing machine has ____________ number of states in a CPU.(a) finite(b) infinte(c) May be finite(d) None of the mentionedThis question was addressed to me in exam.My doubt stems from Programming Techniques-Storage and Subroutines in chapter Introduction to Turing Machines of Automata Theory
Which of the following statements are false?(a) Every recursive language is recursively ennumerable(b) Recursively ennumerable language may not be recursive(c) Recursive languages may not be recursively ennumerable(d) None of the mentionedThis question was posed to me in final exam.Asked question is from The Language of Turing Machine-2 in section Introduction to Turing Machines of Automata Theory
The ability for a system of instructions to simulate a Turing Machine is called _________(a) Turing Completeness(b) Simulation(c) Turing Halting(d) None of the mentionedI got this question during an online exam.This interesting question is from Turing Machine-Notation and Transition Diagrams topic in section Introduction to Turing Machines of Automata Theory

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment