###### JNU 2018-1 PhD CS

October 26, 2023###### JNU 2018-2 PhD CS

October 26, 2023# JNU 2018-2 PhD CS

Question 1 |

If L and ~L (complement of L) are recursive enumerable, then L is

regular | |

context free | |

context sensitive | |

recursive |

Question 1 Explanation:

If L is recursively enumerable that means a TM accepts all strings in L. ~L is recursively enumerable means that a TM accepts all strings in ~L.So we can always decide if a string is in L or not. Since we can always decide so it is recursive.

Correct Answer: D

Question 1 Explanation:

If L is recursively enumerable that means a TM accepts all strings in L. ~L is recursively enumerable means that a TM accepts all strings in ~L.So we can always decide if a string is in L or not. Since we can always decide so it is recursive.

Subscribe

Login

0 Comments