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 closure-property
1
vote
1
answer
61
closure property
CFL over a single alphabet are always-> A. dcfl B. regular C. dcfl but not regular d. non regular
raviyogi
asked
in
Theory of Computation
Dec 30, 2017
by
raviyogi
682
views
theory-of-computation
context-free-language
closure-property
regular-language
0
votes
1
answer
62
Some basic properties
1. Turing Decidable means Recursive language 2. Turing recognizable means REL 3. Decidable means Recursive 4. Undecidable means REL or Turing Recognizable. Does the 4th statement is correct or not . Plz give valid assertions and reasons.
dragonball
asked
in
Theory of Computation
Dec 20, 2017
by
dragonball
346
views
theory-of-computation
closure-property
0
votes
0
answers
63
Closure properties
Subset of Regular Language is REL or not ? PLz Explain with an Example.
dragonball
asked
in
Theory of Computation
Dec 20, 2017
by
dragonball
531
views
theory-of-computation
closure-property
0
votes
0
answers
64
Toc epsilon closure
Given transition for a $\epsilon$-NFA for p => $\delta (p,\epsilon ) = \left \{ q,r \right \}$ . The question asks for |$\epsilon$-closure(p)| = ? Given answer is 2 {q,r} but should it not be {p,q,r} as p itself is transition state of $\epsilon$-closure(p) ?
sumit chakraborty
asked
in
Theory of Computation
Dec 5, 2017
by
sumit chakraborty
1.0k
views
theory-of-computation
closure-property
0
votes
1
answer
65
TOC closure property doubt
If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1 - L2 will be : regular or CFL and why ? My doubt is that since L2 is a regular language and L1 is CFL and L2 will contain all strings in L1, so ... ). Complement of regular is regular and intersection of CFL with regular is closed and the language will be CFL. Which one is right and why ?
sumit chakraborty
asked
in
Theory of Computation
Nov 29, 2017
by
sumit chakraborty
558
views
theory-of-computation
closure-property
context-free-language
regular-language
4
votes
0
answers
66
Proof of Decidability and Closure properties of various language ?
Hi Guys, If someone can provide proof or some kind of intuition for following properties then it will be great help. Because many problem could be solved via these two tables. https://gatecse.in/grammar-decidable-and-undecidable-problems/ https://gatecse.in/closure-property-of-language-families/ PS: Mainly for CFL, CSL, REC and RE.
Chhotu
asked
in
Theory of Computation
Nov 19, 2017
by
Chhotu
544
views
theory-of-computation
closure-property
decidability
1
vote
0
answers
67
Intersection of Different languages
please help me .How to fill this table?
Parshu gate
asked
in
Theory of Computation
Nov 10, 2017
by
Parshu gate
341
views
theory-of-computation
closure-property
2
votes
1
answer
68
Ace Test Series: Theory Of Computation - Closure Property
please explain:
raviyogi
asked
in
Theory of Computation
Nov 4, 2017
by
raviyogi
896
views
ace-test-series
theory-of-computation
bad-question
closure-property
2
votes
2
answers
69
Right Quotient
$L_{1}=\left\{a^{n}b^{n}c^{n}|n>=0\right\}\\ L_{2}=\left\{b^{i}c^{j}|i,j>=0\right\}\\ Find \ out\ L_{1}/L_{2}$
Prabhanjan_1
asked
in
Theory of Computation
Nov 3, 2017
by
Prabhanjan_1
1.5k
views
theory-of-computation
closure-property
regular-language
4
votes
1
answer
70
Question regarding DCFL Closure Properties
May someone please explain via simple Set Theory Basics that why DCFL is "not" closed under - 1) UNION 2) INTERSECTION 3) SET DIFFERENCE but is "closed" under complement. Things I know - a) DCFL is proper subset of CFL Thank you! I'm being forced to By Heart them, but I don't want to.
iarnav
asked
in
Theory of Computation
Nov 1, 2017
by
iarnav
2.1k
views
theory-of-computation
closure-property
context-free-language
3
votes
1
answer
71
Self Doubt Closure Properties of CFL
If L1 = Regular L and L2 = CFL then L1 UNION L2? = L1 U L2 = Reg L U CFL = CFL U CFL = CFL is it True?
iarnav
asked
in
Theory of Computation
Nov 1, 2017
by
iarnav
572
views
theory-of-computation
closure-property
regular-language
context-free-language
2
votes
0
answers
72
TOC - Micheal Sipser - Regular languages
How to prove shuffle ,perfect shuffle and Drop-out property of Regular languages ?
Prajwal Bhat
asked
in
Theory of Computation
Oct 24, 2017
by
Prajwal Bhat
549
views
theory-of-computation
regular-language
closure-property
3
votes
1
answer
73
Closure Property
L3 and L4 are CFL,L5 is regular. L1=(L3 Union L4)c L2=(L3R Union L4) Intersection L5 L1 and L2 are a.Both CFL b.CSL and CFL c.Recursive and CFL d.None of these
Mohammed Sumair
asked
in
Theory of Computation
Oct 14, 2017
by
Mohammed Sumair
528
views
theory-of-computation
closure-property
3
votes
0
answers
74
Closure Properties
Which of the following are closed/ not closed under infinite Union? a.DCFL b.CFL c.CSL d.Recursive Languages e.Recursively enumerable languages
Mohammed Sumair
asked
in
Theory of Computation
Oct 14, 2017
by
Mohammed Sumair
421
views
closure-property
theory-of-computation
1
vote
1
answer
75
Closure
Context-free grammar is closed over intersection true/false.
Sunil8860
asked
in
CO and Architecture
Aug 16, 2017
by
Sunil8860
310
views
theory-of-computation
closure-property
1
vote
0
answers
76
Properties of Regular Language with Non- regular Language
Can anyone elaborate the properties of regular language with non regular under union, intersection, set difference , complement etc.
dragonball
asked
in
Theory of Computation
Aug 16, 2017
by
dragonball
531
views
theory-of-computation
regular-language
closure-property
0
votes
1
answer
77
Test by Bikram | Theory of Computation | Test 2 | Question: 4
Which of the following statements is FALSE? Recursive Enumerable Languages are not closed under set difference and complementation. Complement of context-free language must be recursive. If a problem $X$ is NP complete and $X \in P,$ then $NP = P$. Membership problem is not decidable for Recursive Languages.
Bikram
asked
in
Theory of Computation
Aug 12, 2017
by
Bikram
445
views
tbb-toc-2
theory-of-computation
closure-property
p-np-npc-nph
1
vote
0
answers
78
Properties
1.Let L be a CFL and R be a Regular language then L $\cap$ R = GIVEN:- always CFL and need not be Regular BUT WHY NOT:- always CFL as well as always Regular R - L = GIVEN:- always CSL and need not be CFL BUT WHY NOT:- always CSL as well as ... R - D = GIVEN:- always DCFL and need not be Regular BUT WHY NOT:- always DCFL as well as always Regular PLEASE GIVE DETAIL EXPLANATION WHY NOT??
learner_geek
asked
in
Theory of Computation
Aug 4, 2017
by
learner_geek
182
views
closure-property
regular-language
theory-of-computation
0
votes
1
answer
79
#PropertiesOfRegularLanguage
Union & Concatenation property of regular language are closed for both DFA & NFA. But while doing union or concatenation of 2 DFAs, we have to insert epsilon transition between both. Adding epsilon doesn't leave DFA as DFA but make them epsilon-NFA. So is both property closed for DFA?
Swati Rauniyar
asked
in
Theory of Computation
Jul 7, 2017
by
Swati Rauniyar
735
views
closure-property
regular-language
finite-automata
1
vote
0
answers
80
Closure properties
Is ((ab)*,+) closed or not closed?
Kaustubh _15
asked
in
Theory of Computation
Jul 5, 2017
by
Kaustubh _15
507
views
theory-of-computation
closure-property
regular-language
1
vote
1
answer
81
clouser property of regular language
What is the difference between substitution property, homomorphism property and inverse homomorphism property? Give an example to best support your answer.
Shubhanshu
asked
in
Theory of Computation
Jul 2, 2017
by
Shubhanshu
1.2k
views
theory-of-computation
regular-language
closure-property
0
votes
1
answer
82
Are all languages closed under regular intersection?
ashish pal
asked
in
Theory of Computation
Jun 30, 2017
by
ashish pal
360
views
closure-property
theory-of-computation
1
vote
1
answer
83
Theory of Computation Closure Properties
We know Regular Union CFL is CFL as they are closed but a doubt came in my mind if Regular - (a+b)* CFL - anbn Isn't it regular (a+b)* U anbn = (a+b)* Then how come this statement Regular Union CFL is CFL as they are closed is true ?? Please correct me if i am wrong..
Himanshu Goyal
asked
in
Theory of Computation
Jun 29, 2017
by
Himanshu Goyal
815
views
theory-of-computation
closure-property
4
votes
1
answer
84
CFL and DCFL
If L1 = { anbncm | n.m >0 } L2 = { anbmcm | n, m > 0} Which of these following are false? 1) L1 ∩ L2 is CFL. 2) L1 ∪ L2 is CFL. 3) L1 and L2 are CFL. 4) L1 ∩ L2 is CSL. I think (1) is FALSE as L1 ∩ L2 becomes CSL. PLease correct me if iam wrong.
AnilGoudar
asked
in
Theory of Computation
Jun 5, 2017
by
AnilGoudar
1.7k
views
theory-of-computation
dcfl
closure-property
5
votes
2
answers
85
ISRO2017-77
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
sh!va
asked
in
Theory of Computation
May 7, 2017
by
sh!va
6.8k
views
isro2017
set-theory
theory-of-computation
recursive-and-recursively-enumerable-languages
closure-property
0
votes
1
answer
86
Peter Linz Exercise 4.3
Ayush Upadhyaya
asked
in
Theory of Computation
Mar 15, 2017
by
Ayush Upadhyaya
247
views
theory-of-computation
regular-language
closure-property
41
votes
6
answers
87
GATE CSE 2017 Set 2 | Question: 04
Let $L_1, L_2$ be any two context-free languages and $R$ be any regular language. Then which of the following is/are CORRECT? $L_1 \cup L_2$ is context-free $\overline{L_1}$ is context-free $L_1 - R$ is context-free $L_1 \cap L_2$ is context-free I, II and IV only I and III only II and IV only I only
khushtak
asked
in
Theory of Computation
Feb 14, 2017
by
khushtak
11.6k
views
gatecse-2017-set2
theory-of-computation
closure-property
2
votes
1
answer
88
Test by Bikram | Mock GATE | Test 3 | Question: 1
$X$ and $Y$ are two sets of strings from $\Sigma^*.$ Assume that $Y\subseteq X.$ Which of the following statements must ALWAYS be true for $X$and $Y?$ If $X$ is finite then $Y$ is finite. If $X$ is regular then $Y$ is regular. If $X$ is context-free, then $Y$ is context-free. I only II only III only I, II & III
Bikram
asked
in
Theory of Computation
Feb 9, 2017
by
Bikram
285
views
tbb-mockgate-3
theory-of-computation
identify-class-language
closure-property
4
votes
0
answers
89
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 non-regular. DCFL/CFL languages are not closed under Subset - Example anbncn is subset of anbnc* which is non-cfl. Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation?
yg92
asked
in
Theory of Computation
Feb 8, 2017
by
yg92
2.8k
views
theory-of-computation
recursive-and-recursively-enumerable-languages
context-sensitive
context-sensitive-languages
closure-property
0
votes
1
answer
90
Decidablity+DCFL
I) L-R where L is DCFl and R is regular. Is L-R also DCFL decidable or not??? II)If L1 is reducible to L2 and L2 is non-RE then L1 is also Non-RE??? III) If L1 is reducible to L2 and L1 is non-RE then L2 is also non-RE??
Rahul Jain25
asked
in
Theory of Computation
Feb 7, 2017
by
Rahul Jain25
827
views
theory-of-computation
decidability
dcfl
closure-property
regular-language
recursive-and-recursively-enumerable-languages
Page:
« prev
1
2
3
4
next »
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 closure-property
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:...