Register

Recent questions tagged closure-property

414
views
1 answers
3 votes
Ace Test Series: Theory Of Computation - Closure Property
Match the following
User Avatar
573
views
2 answers
1 votes
CMI2016-B-4
Let $\Sigma = \{0, 1\}$. Let $A, \: B$ be arbitrary subsets of $\Sigma^\ast$ ... If yes, give a proof. If not, provide suitable $A$ and $B$ for which this equation fails.
User Avatar
916
views
2 answers
2 votes
CMI2016-A-3
For a regular expression $e$, let $L(e)$ be the language generated by $e$. If $e$ is an expression that has no Kleene star $\ast$ occurring in it, ... is finiteComplement of $L(e)$ is emptyBoth $L(e)$ and its complement are infinite
User Avatar
678
views
1 answers
3 votes
TIFR CSE 2016 | Part B | Question: 2
Which language class has the following properties?$\quad$ It is closed under union and intersection but not complement.Regular ... -free languageRecursive languageRecursively enumerable languageLanguages that are not recursively enumerable
User Avatar
627
views
1 answers
0 votes
MadeEasy Subject Test 2017: Theory of Computation - Closure Property
Consider the following statements:S1: Complement of CSL is CSL.S2: Complement of every turing recognizable language is turing recognizable.S3: Turing ... 0My question is what is the difference between turing decidable and recognizable
User Avatar
848
views
1 answers
3 votes
GateForum Test Series.
$L_{1}=\{a^nb^mc^md^n | m,n \geq 1\} \\ L_{2}=\{0^p1^q\ |p > q\geq 0\} \cup \{0^p1^q\ |q > p\geq 0\} \\ L_{3} = L_1 \cup L_2 \\ L_{4} = L_1L_2 $ ...
User Avatar
852
views
1 answers
1 votes
regular languages closure properties
What is difference between Kleene closure and infinite union in context of regular languages?
User Avatar
769
views
1 answers
1 votes
closure property of CFL
How to prove this..CFL is closed under intersection with regular languages.
User Avatar
420
views
1 answers
0 votes
GF TOC Assessment test
User Avatar
12.3k
views
8 answers
33 votes
GATE CSE 1989 | Question: 3-ii
Context-free languages and regular languages are both closed under the operation (s) of :UnionIntersectionConcatenationComplementation
User Avatar
477
views
1 answers
1 votes
context free language
Σ ={a,b}L={W| na(W)*nb(W) ≥ 5}Is the above language is REGULAR ??
User Avatar
1.4k
views
2 answers
4 votes
CFL closure property
$L = \left \{ a^nb^n \ ; n\geq 0 \ , n \neq 20 \right \}$ is(a) a DCFL(b) a recursive set but not CFL(c) a CFL but not DCFL(d) not a CFL
User Avatar
2.3k
views
2 answers
2 votes
UGC NET CSE | December 2015 | Part 3 | Question: 22
The family of context sensitive languages is _____ under union and ____ under reversalclosed, not closednot closed, not closedclosed, closednot closed, closed
User Avatar
12.0k
views
1 answers
6 votes
Homomorphism
What exactly Homomorphism of a language is? What is the need of it? .. And how is it closed under regular languages?
User Avatar
2.8k
views
4 answers
1 votes
UGC NET CSE | December 2012 | Part 3 | Question: 38
Which is not the correct statement?The class of regular sets is closed under homomorphismsThe class of regular sets is not closed under inverse ... is closed under quotientThe class of regular sets is closed under substitution
User Avatar
4.6k
views
1 answers
4 votes
UGC NET CSE | June 2012 | Part 2 | Question: 40
Consider the following statements:Recursive languages are closed under complementationRecursively enumerable languages are closed under unionRecursively enumerable languages are closed under ... are true?I onlyI and III and IIIII and III
User Avatar
521
views
2 answers
0 votes
DM/ Set Problem
S1: There exists infinite sets A, B, C such that A ∩ (B ∪ C) is finite.S2: There exists two irrational numbers x and y such that (x+y) is rational.Which ... are correct(D) S1 and S2 both are not correct(E) If you think any other options.
User Avatar
8.7k
views
1 answers
1 votes
Closure Properties Table
https://gateoverflow.in/?qa=blob&qa_blobid=8929616163903734815
User Avatar
12.5k
views
2 answers
49 votes
GATE CSE 2016 Set 2 | Question: 18
Consider the following types of languages: $L_{1}$: Regular, $L_{2}$: Context-free, $L_{3}$: Recursive, $L_{4}$: Recursively enumerable. Which of the following is/are ... context-free.I only.I and III only.I and IV only.I, II and III only.
User Avatar
2.4k
views
1 answers
3 votes
MadeEasy Test Series: Theory of Computation- Closure Property
Which of the following is false ?a. Union of two recursive languages is recursive b. Intersection of regular and recursive language is recursivec. Union ... each option..and also describe intersection of regular and recursive is recursive..
User Avatar
793
views
2 answers
3 votes
toc
$L1$ is a Context free language (CFL), $L2$ is a Deterministic Context free language (DCFL)and , $L = L1 \cap\overline{L2}$then $L$ isa) Need not be CFLb) not CFLc)DCFL
User Avatar
7.7k
views
2 answers
25 votes
TIFR CSE 2014 | Part B | Question: 14
Which the following is FALSE?Complement of a recursive language is recursive.A language recognized by a non-deterministic Turing machine can also be recognized by ... a non-recursive language can never be recognized by any Turing machine.
User Avatar
2.5k
views
4 answers
17 votes
TIFR CSE 2013 | Part B | Question: 11
Which of the following statements is FALSE?The intersection of a context free language with a regular language is context free.The intersection of two regular ... of a regular language and the complement of a regular language is regular.
User Avatar
1.2k
views
1 answers
1 votes
The recursive sets are not closed under :
User Avatar
2.7k
views
2 answers
3 votes
True or False: DCFL is closed under set difference
True or False: DCFL is closed under set difference
User Avatar
13.6k
views
5 answers
13 votes
General Doubt
the complement of every context-free language is recursive ? or recursive enumerable? or both?
User Avatar
10.2k
views
6 answers
39 votes
GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ isalways regularnever regularalways a deterministic context-free languagealways a context-free language
User Avatar
21.5k
views
6 answers
40 votes
GATE CSE 2013 | Question: 17
Which of the following statements is/are FALSE?For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.Turing recognizable languages are closed under ... $3$ only $2$ only $3$ only
User Avatar
11.7k
views
5 answers
37 votes
GATE CSE 2002 | Question: 2.14
Which of the following is true?The complement of a recursive language is recursiveThe complement of a recursively enumerable language is recursively ... recursively enumerableThe complement of a context-free language is context-free
User Avatar
8.9k
views
1 answers
34 votes
GATE CSE 1992 | Question: 16
Which of the following three statements are true? Prove your answer.The union of two recursive languages is recursive.The language $\{O^n \mid n\text{ is a prime} \}$ is not regular.Regular languages are closed under infinite union.
User Avatar
Page: