Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
How to solve?
Recent questions tagged identify-class-language
3
votes
2
answers
1
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 44
Which of the following statements is/are false? Let $\text{A}$ and $\text{B}$ be sets of languages over some fixed alphabet $\Sigma$, with $\text{A} \subseteq \text{B}$. If $\text{A}$ is closed under some operation $\text{P},$ then ... $\mathrm{L} 2$ $\subseteq \mathrm{L} 1$, then $\mathrm{L} 2$ is decidable.)
Which of the following statements is/are false?Let $\text{A}$ and $\text{B}$ be sets of languages over some fixed alphabet $\Sigma$, with $\text{A} \subseteq \text{B}$. I...
GO Classes
562
views
GO Classes
asked
Jan 21
Theory of Computation
goclasses2024-mockgate-12
goclasses
theory-of-computation
identify-class-language
multiple-selects
2-marks
+
–
1
votes
1
answer
2
Is it DCFL or CFL?
If it’s DCFL then also construct the DPDA ?
If it’s DCFL then also construct the DPDA ?
vedantk
155
views
vedantk
asked
Jan 10
Theory of Computation
theory-of-computation
context-free-language
dcfl
identify-class-language
pushdown-automata
+
–
3
votes
1
answer
3
TIFR CSE 2023 | Part B | Question: 2
Which of the following is true about the set of regular languages and the set of recursively enumerable languages over a finite alphabet $\Sigma?$ The set of regular languages is countable while the set of recursively enumerable languages ... whether the set of recursively enumerable languages is countable or not is not known and is a longstanding open problem.
Which of the following is true about the set of regular languages and the set of recursively enumerable languages over a finite alphabet $\Sigma?$ The set of regular lang...
admin
557
views
admin
asked
Mar 14, 2023
Theory of Computation
tifr2023
theory-of-computation
identify-class-language
+
–
2
votes
0
answers
4
TIFR CSE 2023 | Part B | Question: 15
Consider the language $L=\left\{a^{i} \$ a^{j} \$ b^{k} \$ \mid k \leqslant \max (i, j), i, j, k \geq 0\right\}$ over the alphabet $\Sigma=\{a, b, \$\}$. The complement of the language $L$ ... free language and $\overline{L}$ is not a context-free language. Neither is $L$ a context-free language nor is $\overline{L}$ a context-free language.
Consider the language $L=\left\{a^{i} \$ a^{j} \$ b^{k} \$ \mid k \leqslant \max (i, j), i, j, k \geq 0\right\}$ over the alphabet $\Sigma=\{a, b, \$\}$. The complement o...
admin
395
views
admin
asked
Mar 14, 2023
Theory of Computation
tifr2023
theory-of-computation
identify-class-language
+
–
4
votes
3
answers
5
GATE CSE 2023 | Question: 14
Which of the following statements is/are $\text{CORRECT}?$ The intersection of two regular languages is regular. The intersection of two context-free languages is context-free. The intersection of two recursive languages is recursive. The intersection of two recursively enumerable languages is recursively enumerable.
Which of the following statements is/are $\text{CORRECT}?$The intersection of two regular languages is regular.The intersection of two context-free languages is context-f...
admin
8.2k
views
admin
asked
Feb 15, 2023
Theory of Computation
gatecse-2023
theory-of-computation
identify-class-language
multiple-selects
1-mark
+
–
0
votes
1
answer
6
UNACADEMY TEST
L={ a^x b^y | x≠y AND x≠2y } Is This CFL? If Yes Than How
L={ a^x b^y | x≠y AND x≠2y } Is This CFL? If Yes Than How
Rajender gill
272
views
Rajender gill
asked
Jan 11, 2023
Theory of Computation
theory-of-computation
identify-class-language
+
–
1
votes
2
answers
7
DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$} Is the above language DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?
ggwon
738
views
ggwon
asked
Dec 29, 2022
Theory of Computation
dcfl
context-free-language
theory-of-computation
identify-class-language
+
–
0
votes
1
answer
8
Unacademy Test
Consider the following language: L = {<M>|M halts after 200 steps for all inputs} Which of the following is True about L? A.L is decidable B.L is undecidable C.Cannot be predicted D.None of the above
Consider the following language:L = {<M>|M halts after 200 steps for all inputs}Which of the following is True about L?A.L is decidableB.L is undecidableC.Cannot be predi...
Rajender gill
529
views
Rajender gill
asked
Dec 21, 2022
Theory of Computation
identify-class-language
recursive-and-recursively-enumerable-languages
+
–
0
votes
0
answers
9
Unacademy Test
Consider the following language: L = {< M > | L(M) has atleast 10 strings} Which of the following is true about L? A.L is decidable B.L is Turing recognizable C.L is not recursive D.None of these
Consider the following language:L = {< M | L(M) has atleast 10 strings}Which of the following is true about L?A.L is decidableB.L is Turing recognizableC.L is not recurs...
Rajender gill
523
views
Rajender gill
asked
Dec 21, 2022
Theory of Computation
identify-class-language
recursive-and-recursively-enumerable-languages
+
–
0
votes
1
answer
10
Unacademy Test
Consider the language given below: L={P!=w | P is prefix of w and w <-{0,1}*} Which is TRUE about L? A.L is CFL B.L is DCFL C.L is CSL CORRECT ANSWER D.L is regular
Consider the language given below:L={P!=w | P is prefix of w and w <-{0,1}*}Which is TRUE about L?A.L is CFLB.L is DCFLC.L is CSL CORRECT ANSWERD.L is regular
Rajender gill
287
views
Rajender gill
asked
Dec 21, 2022
Theory of Computation
theory-of-computation
identify-class-language
+
–
0
votes
0
answers
11
Test-Series
Consider the following language: $L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings } Which of the following is true about L? A)L is decidable B)L is Turing recognizable C)L is not recursive D)None of these
Consider the following language:$L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings }Which of the following is true about L?A)L is decidable ...
Pranavpurkar
448
views
Pranavpurkar
asked
Nov 16, 2022
Theory of Computation
theory-of-computation
test-series
identify-class-language
multiple-selects
+
–
0
votes
0
answers
12
Test-Series
Consider the language given below: $L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*} Which of following is true about L. A)L is CFL B)L is DCFL C)L is CSL D)L is regular
Consider the language given below:$L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*}Which of following is true about ...
Pranavpurkar
422
views
Pranavpurkar
asked
Nov 16, 2022
Theory of Computation
theory-of-computation
identify-class-language
test-series
+
–
1
votes
1
answer
13
Test-Series
Consider the following language given below: I. L1= { $p^xq^y$ |; x,y >0 } II. L2 = {$p^xq^yp^z$ |$ x>y$ , $y\geq 0$ and $z>0$} Which of the following is true about L1 intersection L2 ? A)It is CSL B)It is CFL C)It is regular D)It is non regular
Consider the following language given below:I. L1= { $p^xq^y$ |; x,y >0 }II. L2 = {$p^xq^yp^z$ |$ x>y$ , $y\geq 0$ and $z>0$}Which of the following is true about L1 inter...
Pranavpurkar
427
views
Pranavpurkar
asked
Nov 13, 2022
Theory of Computation
theory-of-computation
multiple-selects
identify-class-language
test-series
+
–
6
votes
2
answers
14
GATE CSE 2022 | Question: 13
Which of the following statements is/are $\text{TRUE}?$ Every subset of a recursively enumerable language is recursive. If a language $\textit{L}$ and its complement $\overline{\textit{L}}$ are both recursively enumerable, then $\textit{L}$ must be recursive. ... $\textit{L}_{1} \cap \textit{L}_{2}$ must be deterministic context-free.
Which of the following statements is/are $\text{TRUE}?$Every subset of a recursively enumerable language is recursive.If a language $\textit{L}$ and its complement $\over...
Arjun
15.4k
views
Arjun
asked
Feb 15, 2022
Theory of Computation
gatecse-2022
theory-of-computation
identify-class-language
recursive-and-recursively-enumerable-languages
multiple-selects
1-mark
+
–
24
votes
2
answers
15
GATE CSE 2022 | Question: 37
Consider the following languages: $L_{1} = \{ a^{n} wa^{n} | w \in \{a,b\}^{\ast}\}$ $L_{2} = \{wxw^{R} | w, x \in \{a,b\}^{*}, |w|, |x| > 0 \}$ Note that $w^{R}$ is the reversal of the string $w.$ Which of the following is/are ... $L_{2}$ are context-free. $L_{1}$ is regular and $L_{2}$ is context-free. $L_{1}$ and $L_{2}$ are context-free but not regular.
Consider the following languages:$L_{1} = \{ a^{n} wa^{n} | w \in \{a,b\}^{\ast}\}$$L_{2} = \{wxw^{R} | w, x \in \{a,b\}^{*}, |w|, |x| 0 \}$Note that $w^{R}$ is the reve...
Arjun
7.2k
views
Arjun
asked
Feb 15, 2022
Theory of Computation
gatecse-2022
theory-of-computation
identify-class-language
context-free-language
multiple-selects
2-marks
+
–
1
votes
2
answers
16
Made Easy Test Series
Why option B is wrong
Why option B is wrong
Nihal Singh
702
views
Nihal Singh
asked
Sep 21, 2021
Theory of Computation
theory-of-computation
identify-class-language
+
–
0
votes
3
answers
17
UGC NET CSE | December 2019 | Part 2 | Question: 48
Consider the following languages: $L_1 = \{ a^nb^nc^m \} \cup \{a^nb^mc^m\}, n, m \geq 0$ $L_2 =\{ww^R \mid w \in\{ a, b \}^*\}$ Where $R$ represents reversible operation. Which one of the following is (are) inherently ambiguous languages(s)? Only $L_1$ Only $L_2$ both $L_1$ and $L_2$ neither $L_1$ nor $L_2$
Consider the following languages:$L_1 = \{ a^nb^nc^m \} \cup \{a^nb^mc^m\}, n, m \geq 0$$L_2 =\{ww^R \mid w \in\{ a, b \}^*\}$ Where $R$ represents reversible operation.W...
soujanyareddy13
1.5k
views
soujanyareddy13
asked
May 12, 2021
Theory of Computation
ugcnetcse-dec2019-paper2
identify-class-language
+
–
19
votes
2
answers
18
GATE CSE 2021 Set 2 | Question: 12
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free? $L_1 \cap \overline{L_2} \\$ $\overline{\overline{L_1} \cup \overline{L_2}} \\$ $L_1 \cup (L_2 \cup \overline{L_2}) \\$ $(L_1 \cap L_2) \cup (\overline{L_1} \cap L_2)$
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free?$L_1 \cap \overline{L_2} \\$$\overline{\overlin...
Arjun
9.9k
views
Arjun
asked
Feb 18, 2021
Theory of Computation
gatecse-2021-set2
multiple-selects
theory-of-computation
identify-class-language
1-mark
+
–
0
votes
1
answer
19
UGC NET CSE | October 2020 | Part 2 | Question: 71
Match $\text{List I}$ with $\text{List II}$ $L_R:$ Regular language, $LCF$: Context free language $L_{REC}:$ Recursive langauge, $L_{RE}$ ... $A-III, B-I, C-II$ $A-I, B-II, C-III$ $A-II, B-I, C-III$
Match $\text{List I}$ with $\text{List II}$$L_R:$ Regular language, $LCF$: Context free language$L_{REC}:$ Recursive langauge, $L_{RE}$: Recursively enumerable language.$...
go_editor
560
views
go_editor
asked
Nov 20, 2020
Theory of Computation
ugcnetcse-oct2020-paper2
theory-of-computation
identify-class-language
+
–
Page:
1
2
3
4
5
6
...
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register