Recent questions tagged closure-property
Register

Recent questions tagged closure-property

Recent questions tagged closure-property
0 votes
0 answers 20 views
GATE2017-2-04 Video Solution
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
admin asked in Theory of Computation Apr 18, 2020
by admin
589 points
20 views
0 votes
0 answers 22 views
GATE2013-17 Video Solution
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 union and complementation. Turing decidable languages are closed under intersection ... languages are closed under union and intersection. 1 and 4 only 1 and 3 only 2 only 3 only
admin asked in Theory of Computation Apr 18, 2020
by admin
589 points
22 views
0 votes
0 answers 23 views
GATE2016-2-18 Video Solution
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 TRUE ? $\overline{L_{3}} \cup L_{4}$ is recursively enumerable. $\overline{L_{2}} \cup L_{3}$ ... $L_{1} \cup \overline{L_{2}}$ is context-free. I only. I and III only. I and IV only. I, II and III only.
admin asked in Theory of Computation Apr 18, 2020
by admin
589 points
23 views
0 votes
0 answers 16 views
GATE2006-IT-32 Video Solution
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language
admin asked in Theory of Computation Apr 18, 2020
by admin
589 points
16 views
0 votes
0 answers 18 views
GATE1989-3-ii Video Solution
Context-free languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
admin asked in Theory of Computation Apr 18, 2020
by admin
589 points
18 views
0 votes
0 answers 16 views
GATE2002-2.14 Video Solution
Which of the following is true? The complement of a recursive language is recursive The complement of a recursively enumerable language is recursively enumerable The complement of a recursive language is either recursive or recursively enumerable The complement of a context-free language is context-free
admin asked in Theory of Computation Apr 18, 2020
by admin
589 points
16 views
0 votes
0 answers 17 views
GATE1992-16 Video Solution
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.
admin asked in Theory of Computation Apr 18, 2020
by admin
589 points
17 views
To see more, click for the full list of questions or popular tags.
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun