Which of the following conversion is not possible (algorithmically)?

Related MCQs

• Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
• Which of the following strings is not generated by the following grammar? S → SaSbS ε
• Fred created a new automaton model which is a push down automaton but with two stacks and the added ability of having commands which do not read input tape but which can pop from one stack and push into the other.This new automaton can recognize (choose strongest result)
• Given S = {a, b}, which one of the following sets is not countable?
• Which of the following is not a regular expression?
• A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
• The Family of recursive language is not closed under which of the following operations:
• If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ?
• Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
• Let S be an NP-complete problem, Q and R be two other problems not known to be in NP. Q is polynomial-time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true?