Awesome q2a theme
0 votes
24 views

in Theory of Computation by (122 points) | 24 views
0
L2 is halting problem.
0
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 (688 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 Dec 2019
  1. Pratyush Priyam Kuan

    158 Points

  2. Vimal Patel

    118 Points

  3. avistein

    65 Points

  4. srestha

    54 Points

  5. Mk Utkarsh

    49 Points

  6. arya_stark

    46 Points

  7. goxul

    39 Points

  8. Sathuri Bharath

    34 Points

  9. vishal burnwal

    31 Points

  10. Shaik Masthan

    26 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
2,313 questions
1,295 answers
6,589 comments
89,719 users