CompleteGATE Doubts Forum
0 like 0 dislike
165 views

Which of the following problems are decidable?

  1. 1)  Does a given program ever produce an output?

  2. 2)  If L is a context-free language, then, is ~L also context-free?

  3. 3)  If L is a regular language, then, is ~L also regular?

  4. 4)  If L is a recursive language, then, is ~L also recursive? 

    (A) 1, 2, 3, 4

    (B) 1, 2 

    (C) 2, 3, 4 

    (D) 3, 4 

asked Jun 27, 2016 in Theory of Computation by CompleteGATE-AskUS (3,550 points) | 165 views

~L stands for complement of L

1 Answer

1 like 0 dislike
Best answer
(D) 3, 4
answered Jun 27, 2016 by ebeisaac (13,250 points)
selected Jul 11, 2016 by CompleteGATE-AskUS
Welcome to Completegate AskUs, A place where you can ask questions regarding videos located at Youtube Channel and receive answers from our experts.

Sign up for our newsletter to receive the latest news and event postings.

Best Users 07/2019
  1. CompleteGATE-AskUS

    3550 Points

  2. Asma Abbasi

    200 Points

  3. Henry

    150 Points

  4. SilverChat

    140 Points

Rewards per month
First Winner: 0 INR (Not Started)
Second Winner: 0 INR (Not Started)

×

Like us on Facebook

Show your Support. Become a FAN!

107 questions
100 answers
2 comments
58 users