Home » Theory of Computation » Theory of computation miscellaneous » Question

Theory of computation miscellaneous

Theory of Computation

  1. Which of the following is true?
    1. The complement of a recursive enumerable language is recursive
    2. The complement of a recursively enumerable language is recursively enumerable
    3. The complement of a recursive language is either recursive or recursively enumerable
    4. The complement of a context-free language is contxt-free
Correct Option: A

Option (a) True : The complement of recursive language is always recursive.
Option (b) False : The recursively enumerable language is the language, when taken its complement, lose its recursively enumerable nature.
Option (c) False : The complement of recursive language is always recursive and never recursively
enumerable.
Option (d) False : The complement of context free language is never context-free.



Your comments will be displayed only after manual approval.