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
UGC NET CSE | January 2017 | Part 3 | Question: 63
go_editor
asked
in
Theory of Computation
Feb 1, 2017
recategorized
Jun 25, 2022
by
Lakshman Patel RJIT
3,173
views
1
vote
1
vote
Which of the following statements is false?
Every context-sensitive language is recursive
The set of all languages that are not recursively enumerable is countable
The family of recursively enumerable language is closed under union
The families of recursively enumerable and recursive languages are closed under reversal
ugcnetcse-jan2017-paper3
theory-of-computation
recursive-and-recursively-enumerable-languages
go_editor
asked
in
Theory of Computation
Feb 1, 2017
recategorized
Jun 25, 2022
by
Lakshman Patel RJIT
by
go_editor
3.2k
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
1
vote
1
vote
Best answer
Option B)
A - CSL is a subset of recursive languages
C and D are their respective closure properties.
Kaushik.P.E
answered
Feb 1, 2017
selected
Feb 2, 2017
by
Debasmita Bhoumik
by
Kaushik.P.E
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
0
votes
0
votes
B is false because all languages which are not recursive enumarable are countable it is not true.
Pallav98
answered
Aug 1, 2020
by
Pallav98
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
Answer:
B
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
5
answers
1
go_editor
asked
in
Theory of Computation
Mar 24, 2020
868
views
UGC NET CSE | January 2017 | Part 3 | Question: 19
Which of the following are not regular? Strings of even number of a’s Strings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s. Strings of a’s whose length is a perfect square. (a) and (b) only (a), (b) and (c) only (b),(c) and (d) only (b) and (d) only
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
868
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
1
vote
1
vote
7
answers
2
go_editor
asked
in
Theory of Computation
Mar 24, 2020
711
views
UGC NET CSE | January 2017 | Part 3 | Question: 20
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$? $\{\in \}$ $\{\in,1\}$ $\phi$ $1^{\ast}$
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
711
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
2
votes
2
votes
6
answers
3
go_editor
asked
in
Theory of Computation
Mar 24, 2020
1,341
views
UGC NET CSE | January 2017 | Part 3 | Question: 21
Given the following statements: A class of languages that is closed under union and complementation has to be closed under intersection A class of languages that is closed under union and intersection has to be closed under complementation Which of the following options is ... ) and (b) are true (a) is true, (b) is false (a) is false, (b) is true
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
1.3k
views
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
0
votes
0
votes
2
answers
4
go_editor
asked
in
Theory of Computation
Mar 24, 2020
612
views
UGC NET CSE | January 2017 | Part 3 | Question: 22
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any $W \in L(G)$ has a height $h$ ... $\log_{K}|W \mid \leq h \leq \left (\frac{ \mid W \mid - 1}{K-1} \right)$
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
612
views
ugcnetcse-jan2017-paper3
context-free-grammar
theory-of-computation
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
