Dark Mode

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.)

GO Classes asked in Theory of Computation Jan 21

536 views

1 vote

1 answer

2

Is it DCFL or CFL?
If it’s DCFL then also construct the DPDA ?

vedantk asked in Theory of Computation Jan 10

144 views

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.

admin asked in Theory of Computation Mar 14, 2023

by admin

526 views

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.

admin asked in Theory of Computation Mar 14, 2023

by admin

387 views

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.

admin asked in Theory of Computation Feb 15, 2023

by admin

7.9k views

0 votes

1 answer

6

UNACADEMY TEST
L={ a^x b^y | x≠y AND x≠2y } Is This CFL? If Yes Than How

Rajender gill asked in Theory of Computation Jan 11, 2023

by Rajender gill

268 views

1 vote

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 ?

ggwon asked in Theory of Computation Dec 29, 2022

by ggwon

705 views

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

Rajender gill asked in Theory of Computation Dec 21, 2022

by Rajender gill

528 views

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

Rajender gill asked in Theory of Computation Dec 21, 2022

by Rajender gill

500 views

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

Rajender gill asked in Theory of Computation Dec 21, 2022

by Rajender gill

282 views

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

Pranavpurkar asked in Theory of Computation Nov 16, 2022

by Pranavpurkar

434 views

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

Pranavpurkar asked in Theory of Computation Nov 16, 2022

by Pranavpurkar

402 views

1 vote

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

Pranavpurkar asked in Theory of Computation Nov 13, 2022

by Pranavpurkar

409 views

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.

Arjun asked in Theory of Computation Feb 15, 2022

by Arjun

14.9k views

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.

Arjun asked in Theory of Computation Feb 15, 2022

by Arjun

7.1k views

1 vote

2 answers

16

Made Easy Test Series
Why option B is wrong

Nihal Singh asked in Theory of Computation Sep 21, 2021

677 views

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$

soujanyareddy13 asked in Theory of Computation May 12, 2021

by soujanyareddy13

1.4k views

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)$

Arjun asked in Theory of Computation Feb 18, 2021

by Arjun

9.8k views

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$

go_editor asked in Theory of Computation Nov 20, 2020

552 views

Page:

1
2
3
4
5
6
...
8
next »

Recent questions tagged identify-class-language