Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged #decidability
0
votes
0
answers
#made easy test series
Let L1 be a decidable language and L2 be a turing recognizable language but not decidable language .consider the following statements: L2\L1 is a turing recognizable language. L1\L2 is a decidable language L2\L1 is a decidable language L1\L2 is turing recognizable language the number of correct statements is/are:
asked
Aug 1
in
Theory of Computation
by
404 found
(
12
points)

12
views
madeeasytestseries
#decidability
0
votes
0
answers
ACe mock test 4 Q54
Please explain the meaning of the question
asked
Jan 4
in
Theory of Computation
by
ssap09
(
43
points)

8
views
#gatepreparation
aceacademytestseries
theoryofcomputation
#decidability
0
votes
0
answers
Test series ME
asked
Nov 20, 2019
in
Theory of Computation
by
Dipanshu Rana
(
34
points)

41
views
madeeasytestseries
#decidability
0
votes
1
answer
Self doubt on a Decidability question
For arbitrary CFG G and arbitrary regular expression R, whether L(R)$\subseteq $L(G) is DECIDABLE ?
asked
Nov 18, 2019
in
Theory of Computation
by
pranay562
(
926
points)

30
views
#toc
#decidability
0
votes
0
answers
Made Easy Test Series 2020
Consider the language L: $L=\{ <M> M $ is a turing machine and $L(M) \leq_p {0^p1^{2p}  p > 0} $ $ \} $ Where the symbol $``\leq_p”$ refers to polynomial time reduction then $L$ is decidable or undecidable $???$
asked
Oct 3, 2019
in
Theory of Computation
by
Optimus Prime
(
6
points)

16
views
#toc
#decidability
0
votes
0
answers
wooe test series
$L = \{ <M>  \text{M is a TM that halts on all inputs and L(M) = L’ for some undecidable language L’} \}$ Then $L$ is decidable and recursive decidable and nonrecursive undecidable and recursively enumerable undecidable and nonrecursively enumerable
asked
Aug 26, 2019
in
Theory of Computation
by
Satbir
(
4.1k
points)

21
views
decidability
#decidability
0
votes
1
answer
gate 2014 toc self doubt
https://gateoverflow.in/1994/gate2014235 in this question can’t we directly apply rices theorem we can have a Tyes for languages with 2014 length input and Tno for Σ* since Tyes subset Tno it shouldnt be recursively enumerable . could someone elaborate where i am wrong?
asked
Aug 6, 2019
in
Theory of Computation
by
TUSHAR_BHATT
(
18
points)

26
views
#toc
#decidability
#ricestheorem
To see more, click for the
full list of questions
or
popular tags
.
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
Top Users
2020 Aug 03  09
Mellophi
97 Points
Ashutosh07091999
69 Points
prakhar2810
7 Points
Kushagra गुप्ता
7 Points
srestha
7 Points
sdutta
6 Points
kuldeep kumar07
6 Points
toppoavinash
6 Points
Shoaib_Ahmed
6 Points
prashastinama
6 Points
Weekly Top User (excluding moderators) will get free access to
GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Aug 2020
Mellophi
103 Points
Ashutosh07091999
72 Points
Shaik Masthan
13 Points
srestha
9 Points
Unnayan kumar
8 Points
prakhar2810
7 Points
Sourav Kar
7 Points
anurag_yo
7 Points
Kushagra गुप्ता
7 Points
sdutta
6 Points
7,711
questions
1,823
answers
11,131
comments
95,090
users