Awesome q2a theme
0 votes

in Theory of Computation by (257 points) | 29 views
L2 is halting problem.
L1 and L2 both undecidable

1 Answer

0 votes

L1 is the emptiness problem of TM which is undecidable

L2 is halting problem and we know that halting problems are undecidable

NOTE: Emptiness problem is decidable only for Regular languages, CFL and DCFL

            but for CSL, REC and RE, it is undecidable.

by (788 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jul 2020
  1. Shaik Masthan

    39 Points

  2. hiteshpujari

    9 Points

  3. Meghana518

    6 Points

  4. bittujash

    6 Points

  5. Pawan_k

    6 Points

  6. srestha

    5 Points

  7. RavGopal

    4 Points

  8. Anirban Chand

    4 Points

  9. Mk Utkarsh

    4 Points

  10. abcd9982

    3 Points

7,536 questions
1,781 answers
90,472 users