Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged recursive-and-recursively-enumerable-languages
26
votes
2
answers
241
GATE CSE 2005 | Question: 56
Let $L_1$ be a recursive language, and let $L_2$ be a recursively enumerable but not a recursive language. Which one of the following is TRUE? $L_1$' is recursive and $L_2$' is recursively enumerable $L_1$' is recursive ... enumerable $L_1$' and $L_2$' are recursively enumerable $L_1$' is recursively enumerable and $L_2$' is recursive
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
5.5k
views
gatecse-2005
theory-of-computation
recursive-and-recursively-enumerable-languages
easy
38
votes
4
answers
242
GATE CSE 2003 | Question: 13
Nobody knows yet if $P=NP$. Consider the language $L$ defined as follows.$L = \begin{cases} (0+1)^* & \text{ if } P = NP \\ \phi & otherwise \end{cases} $Which of the following statements is true? $L$ is recursive $L$ is ... but not recursive $L$ is not recursively enumerable Whether $L$ is recursively enumerable or not will be known after we find out if $P=NP$
Kathleen
asked
in
Theory of Computation
Sep 16, 2014
by
Kathleen
9.6k
views
gatecse-2003
theory-of-computation
normal
recursive-and-recursively-enumerable-languages
27
votes
5
answers
243
GATE CSE 2008 | Question: 48
Which of the following statements is false? Every NFA can be converted to an equivalent DFA Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine Every regular language is also a context-free language Every subset of a recursively enumerable set is recursive
Kathleen
asked
in
Theory of Computation
Sep 12, 2014
by
Kathleen
8.6k
views
gatecse-2008
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
33
votes
5
answers
244
GATE CSE 2008 | Question: 13, ISRO2016-36
If $L$ and $\overline{L}$ are recursively enumerable then $L$ is regular context-free context-sensitive recursive
Kathleen
asked
in
Theory of Computation
Sep 11, 2014
by
Kathleen
11.6k
views
gatecse-2008
theory-of-computation
easy
isro2016
recursive-and-recursively-enumerable-languages
57
votes
4
answers
245
GATE CSE 2003 | Question: 15
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true? $L$ is necessarily finite $L$ is regular but not necessarily finite $L$ is context free but not necessarily regular $L$ is recursive but not necessarily context-free
gauravsachan9188
asked
in
Theory of Computation
Aug 24, 2014
by
gauravsachan9188
15.5k
views
theory-of-computation
gatecse-2003
normal
recursive-and-recursively-enumerable-languages
17
votes
2
answers
246
L(M) = Σ*
$L= \{\langle M \rangle\mid L(M) = \Sigma^*\} $ A. $L$ is RE but $L'$ is not RE B. Both $L$ and $L'$ are RE C. $L$ is not RE but $L'$ is RE D. Both $L$ and $L'$ are not RE
gatecse
asked
in
Theory of Computation
Aug 20, 2014
by
gatecse
2.3k
views
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
decidability
difficult
17
votes
4
answers
247
L(M) is infinite
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$ $L$ is RE but $L'$ is not RE Both $L$ and $L'$ are RE $L$ is not RE but $L'$ is RE Both $L$ and $L'$ are not RE
gatecse
asked
in
Theory of Computation
Aug 20, 2014
by
gatecse
5.7k
views
theory-of-computation
identify-class-language
turing-machine
decidability
recursive-and-recursively-enumerable-languages
difficult
Page:
« prev
1
...
4
5
6
7
8
9
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged recursive-and-recursively-enumerable-languages
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...