@

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

Test by Bikram | Theory of Computation | Test 1 | Question: 28

Bikram asked in Theory of Computation Nov 26, 2016 edited Aug 17, 2019 by go_editor

79 views

0 votes

0 votes

Recursive Enumerable Languages are NOT closed under :

Union
Intersection
Complement
Homomorphism

tbb-toc-1

Bikram asked in Theory of Computation Nov 26, 2016 edited Aug 17, 2019 by go_editor

by Bikram

79 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

0 votes

Best answer

Recursively Enumerable languages were not closed under complementation . Option C is correct .

see this https://www.quora.com/Why-are-recursively-enumerable-languages-not-closed-under-complementation

Bikram answered Jul 16, 2017 selected Aug 17, 2019 by Bikram

by Bikram

0 Comments

Please log in or register to add a comment.

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

6 votes

6 votes

2 answers

1

Bikram asked in Theory of Computation Nov 26, 2016

601 views

Test by Bikram | Theory of Computation | Test 1 | Question: 30
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is: Decidable Undecidable but semi-decidable Not even semi-decidable Indeterminable

Bikram asked in Theory of Computation Nov 26, 2016

by Bikram

601 views

tbb-toc-1

0 votes

0 votes

1 answer

2

Bikram asked in Theory of Computation Nov 26, 2016

168 views

Test by Bikram | Theory of Computation | Test 1 | Question: 29
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an: Decidable problem Undecidable problem Cannot ascertain None

Bikram asked in Theory of Computation Nov 26, 2016

by Bikram

168 views

tbb-toc-1

0 votes

0 votes

1 answer

3

Bikram asked in Theory of Computation Nov 26, 2016

84 views

Test by Bikram | Theory of Computation | Test 1 | Question: 27
If $S$ and $T$ are languages over $\Sigma =\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$ respectively, then which of the following options is CORRECT? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \emptyset$

Bikram asked in Theory of Computation Nov 26, 2016

by Bikram

84 views

tbb-toc-1
regular-expression
easy

1 vote

1 vote

1 answer

4

Bikram asked in Theory of Computation Nov 26, 2016

396 views

Test by Bikram | Theory of Computation | Test 1 | Question: 26
$L1$ and $L2$ are regular languages. $L3$ is CFL and $L4$ is a recursive enumerable language. $L5$ is the reversal of $L4$. If $L6= \{ (L3/y)$ intersection $L5 \}$ where $y$ is input alphabet, then $L6$ is a: Regular Language CFL Recursive Enumerable Language Non Recursive Enumerable Language

Bikram asked in Theory of Computation Nov 26, 2016

by Bikram

396 views

tbb-toc-1

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

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

BITSHD 2023
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24

Subjects

All categories
General Aptitude (2.5k)
Engineering Mathematics (9.3k)
Digital Logic (3.3k)
Programming and DS (5.9k)
Algorithms (4.6k)
Theory of Computation (6.7k)
Compiler Design (2.3k)
Operating System (5.0k)
Databases (4.6k)
CO and Architecture (3.8k)
Computer Networks (4.7k)
Non GATE (1.3k)
Others (2.5k)
Admissions (653)
Exam Queries (845)
Tier 1 Placement Questions (17)
Job Queries (76)
Projects (9)
Unknown Category (866)

Recent Blog Comments

Please provide some tips about NET, since I want...
Amazing story to hear
Link added now:...
Sir can you please provide some good resources...
Where can we see the responses of the form filled?

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!