The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged recursiveandrecursivelyenumerablelanguages
+1
vote
0
answers
1
geeksforgeeks
asked
Aug 15, 2017
in
Theory of Computation
by
Sunil8860

57
views
recursiveandrecursivelyenumerablelanguages
+1
vote
1
answer
2
geeksforgeeks
?
asked
Aug 15, 2017
in
Theory of Computation
by
Sunil8860

82
views
recursiveandrecursivelyenumerablelanguages
decidability
+1
vote
1
answer
3
TOC RE REC
A RE language can also be called as Turing Recognizable,Turing Acceptable or Turing Enumerable. And REC can be called as Turing Decidable. Now When we say that a language is Turing Computable, Strictly what we could say that it is RE or REC? (Ofcourse if it is REC then it is RE also) PS : It would be great if you could provide some reliable source for it.
asked
Aug 9, 2017
in
Theory of Computation
by
VS

556
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+1
vote
1
answer
4
TOC Not RE language Set
Why set of Not RE languages is uncountable infinite ?Not RE is discrete in nature?
asked
Aug 8, 2017
in
Theory of Computation
by
rahul sharma 5

384
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+1
vote
2
answers
5
Self Doubt TOC Enumeration Method
If language L is countable infinite set then, L is Recursive as we can define enumeration method for the countable set. or It can Regular ??
asked
Jul 17, 2017
in
Theory of Computation
by
AnilGoudar

212
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
6
Union of R.E and non R.E
What is the class of the language resulting from Union of R.E and non R.E ? (R.E => recursively enumerable)
asked
Jun 18, 2017
in
Theory of Computation
by
Xylene

420
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
7
Language which is not a CSL but can be accepted by TM
Can anyone give me an example of a language which is not a CSL but can be accepted using a TM?
asked
Jun 16, 2017
in
Theory of Computation
by
Xylene

451
views
theoryofcomputation
contextfreelanguages
pushdownautomata
contextsensitive
recursiveandrecursivelyenumerablelanguages
turingmachine
0
votes
1
answer
8
Peter Linz Exercise 11.1
If L is recursive, is it necessarily true that L+ is also recursive?
asked
May 14, 2017
in
Theory of Computation
by
Ayush Upadhyaya

286
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
0
answers
9
Peter Linz Exercise 11.1
Prove that the complement of context free language is recursive.
asked
May 14, 2017
in
Theory of Computation
by
Ayush Upadhyaya

110
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
contextfreelanguages
+4
votes
2
answers
10
ISRO201777
If $L$ and $P$ are two recursively enumerable languages then they are not closed under Kleene star $L^*$ of $L$ Intersection $L \cap P$ Union $L \cup P$ Set difference
asked
May 8, 2017
in
Theory of Computation
by
sh!va

3.6k
views
isro2017
sets
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
closureproperty
+2
votes
4
answers
11
Recursive languages.
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
asked
May 3, 2017
in
Theory of Computation
by
AnilGoudar

352
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
0
answers
12
theory of computation
L = { <M> / M is a Turing machine and M accepts a regular language }. This Language L is recursively enumerable but not recursive. ...right ??
asked
Apr 22, 2017
in
Theory of Computation
by
vignesh

100
views
theoryofcomputation
decidability
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
13
theory of computation
L = { <M,w> / M is a TM,w is a string and M on simulating w,the Read/write head of M moves 100 steps away from the left most symbol of input }.Assume initially the Read/write head is in leftmost symbol of input. MY ANSWER : This language is Recursively enumerable but not recursive ...right ???
asked
Apr 22, 2017
in
Theory of Computation
by
vignesh

155
views
theoryofcomputation
decidability
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
14
theory of computation
This language, L = { <M,w> / M is a TM,w is a string and M does not halt on string w } is not recursively enumerable ...right ???
asked
Apr 21, 2017
in
Theory of Computation
by
vignesh

104
views
theoryofcomputation
decidability
recursiveandrecursivelyenumerablelanguages
+1
vote
2
answers
15
theory of computation
Which of the following languages below are NOT recursively enumerable ? L1 = {<M> / M is a TM that accepts all even numbers }. L2 = {<M> / M does not accept all even numbers } L3 = {<M> / M rejects all even numbers } A) Only L1 B) Only L1 and L2 C) Only L1 and L3 D) All of L1,L2 and L3
asked
Apr 21, 2017
in
Theory of Computation
by
vignesh

220
views
theoryofcomputation
decidability
recursiveandrecursivelyenumerablelanguages
0
votes
2
answers
16
decidability
is intersection of two context sensitive decidable?? I think since they are closed under intersection, it must be decidable. please answer
asked
Feb 10, 2017
in
Theory of Computation
by
sushmita

327
views
decidability
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
+3
votes
0
answers
17
Are CSL, RE, Recursive languages closed under Subset operation?
Regular languages are not closed under Subset  Example anbn is subset of a*b* which is nonregular. DCFL/CFL languages are not closed under Subset  Example anbncn is subset of anbnc* which is noncfl. Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation?
asked
Feb 8, 2017
in
Theory of Computation
by
yg92

804
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
contextsensitive
contextsensitivelanguages
closureproperty
0
votes
1
answer
18
Decidablity+DCFL
I) LR where L is DCFl and R is regular. Is LR also DCFL decidable or not??? II)If L1 is reducible to L2 and L2 is nonRE then L1 is also NonRE??? III) If L1 is reducible to L2 and L1 is nonRE then L2 is also nonRE??
asked
Feb 8, 2017
in
Theory of Computation
by
Rahul Jain25

381
views
theoryofcomputation
decidability
dcfl
closureproperty
regularlanguages
recursiveandrecursivelyenumerablelanguages
+1
vote
0
answers
19
MadeEasy Subject Test: Theory of Computation  Recursive And Recursively Enumerable Languages
asked
Feb 1, 2017
in
Theory of Computation
by
vaishali jhalani

82
views
madeeasytestseries
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+2
votes
1
answer
20
RE or Non RE
1) Language describing the ambiguity of CFG is RE or Non RE? 2) Language describing the nonambiguity of a CFG (whether a given CFG is nonambiguous) and complement of the language of ambiguity of CFG are RE or Non RE? 3) Inherent Ambiguity of CFL is RE or Non RE? 4) Is language of the complement of Ambiguity and the language of nonambiguity of CFG same?
asked
Jan 30, 2017
in
Theory of Computation
by
srestha

587
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
21
Countable and recursive language relation
Is every countable language recursive enumerable?
asked
Jan 28, 2017
in
Theory of Computation
by
Purple

91
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
countableuncountableset
0
votes
0
answers
22
Gate Practice
Let L be regular language and R be turing recognizable but not accepting language. How many of the following is possible.? 1.compliment of R can be Turing recognizable. 2.L U (R)' can be recursive. 3.set of strings common in R and L can be in not RE. 4.L U R can be recursive. 5.set of strings common in R' and L can be recursive.
asked
Jan 24, 2017
in
Theory of Computation
by
Ravi_1511

59
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+1
vote
1
answer
23
REC or NONREC
asked
Jan 19, 2017
in
Theory of Computation
by
vaishali jhalani

144
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+3
votes
1
answer
24
L = { 0n+m 1n+m 0m  n, m >= 0 } CSL or RE?
L = { 0n+m 1n+m 0m  n, m >= 0 } The above language is (a) CFL but not Regular (b) CSL but not CFL (c) RE but not CSL (d) None of the above I thought the answer would be (b) CSL but not CFL but it was given as (c) RE but not CSL Can anyone explain how?
asked
Jan 16, 2017
in
Theory of Computation
by
asterixbachman

871
views
theoryofcomputation
contextsensitivelanguages
contextsensitive
recursiveandrecursivelyenumerablelanguages
+1
vote
2
answers
25
Doubt in GateCse Decidability Blog
In the deciadability chart mentioned on http://gatecse.in/grammardecidableandundecidableproblems/ The undecidable problems mentioned here are semidecidable(RE but not REC) not NOT RE.Or there is no such relation? Can someone have a look and tell please?
asked
Jan 15, 2017
in
Theory of Computation
by
rahul sharma 5

291
views
decidability
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
turingmachine
+3
votes
1
answer
26
toc doubt
asked
Jan 15, 2017
in
Theory of Computation
by
Arnabi

604
views
theoryofcomputation
decidability
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
27
TOC Recurive language
R = RE ∩ CoRE where R is the set of recursive language,RE is the set of languages of which membership can be proved in finite time and CoRE is the set of language of which membership can be disproved in finite amount of time True/False?
asked
Jan 6, 2017
in
Theory of Computation
by
Prajwal Bhat

42
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
+2
votes
0
answers
28
Turing Recognizable (TestBook Question)
Which of the following is/are NOT turingrecognizable? 1. L1={M1M2M1M2 are Turing Machines with L(M1)=L(M2)} 2. L2={M,wM is a Turing Machine that halts on input w} 3. L3={M,wM is a Turing Machine that accepts string w} 4.All of the Above
asked
Jan 2, 2017
in
Theory of Computation
by
Archies09

289
views
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
29
TOC Recursive languages
How does complement of a Recursively enumerable but not recursive is not recursively enumerable?
asked
Dec 28, 2016
in
Theory of Computation
by
Veerendra V

165
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
decidability
Page:
« prev
1
2
3
4
5
6
7
next »
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
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
IIT Bombay Mtech RA  interview experience (2020)
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged recursiveandrecursivelyenumerablelanguages
Recent Blog Comments
Can someone tell me how to check part B marks?...
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,490
answers
201,835
comments
95,299
users