Search results for identify-class-language / GATE Overflow for GATE CSE

29 votes

7 answers

1

GATE CSE 2020 | Question: 10
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements. $L$ is deterministic context-free. $L$ is context-free but not deterministic context-free. $L$ is not $LL(k)$ for any $k$. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Ⅰ and Ⅲ only Ⅲ only

Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements.$L$ is deterministic context-free.$L$ is context-free but...

Arjun

20.1k views

Arjun asked Feb 12, 2020

33 votes

4 answers

2

GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.

Consider the following languages.$$\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \e...

Arjun

18.0k views

Arjun asked Feb 12, 2020

6 votes

2 answers

3

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.3k views

Arjun asked Feb 15, 2022

4 votes

3 answers

4

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.1k views

admin asked Feb 15, 2023

50 votes

9 answers

5

GATE CSE 2018 | Question: 35
Consider the following languages: $\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$ $\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \geq 0 \}$ ... Which of the above languages are context-free? I and IV only I and II only II and III only II and IV only

Consider the following languages:$\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$$\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \ge...

gatecse

21.2k views

gatecse asked Feb 14, 2018

53 votes

3 answers

6

GATE CSE 2006 | Question: 30
For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let $L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod } 7\neq 4 \right \}$Which ... following statements is true? $L$ is recursively enumerable, but not recursive $L$ is recursive, but not context-free $L$ is context-free, but not regular $L$ is regular

For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let$$L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod ...

Rucha Shelke

7.7k views

Rucha Shelke asked Sep 18, 2014

3 votes

2 answers

7

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

556 views

GO Classes asked Jan 21

24 votes

2 answers

8

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

1 votes

1 answer

9

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

If it’s DCFL then also construct the DPDA ?

vedantk

147 views

vedantk asked Jan 10

19 votes

2 answers

10

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

40 votes

4 answers

11

GATE CSE 2000 | Question: 1.5
Let $L$ denote the languages generated by the grammar $S \to 0S0 \mid 00$. Which of the following is TRUE? $L = 0^+$ $L$ is regular but not $0^+$ $L$ is context free but not regular $L$ is not context free

Let $L$ denote the languages generated by the grammar $S \to 0S0 \mid 00$.Which of the following is TRUE?$L = 0^+$$L$ is regular but not $0^+$$L$ is context free but not ...

Kathleen

10.4k views

Kathleen asked Sep 14, 2014

3 votes

1 answer

12

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

543 views

admin asked Mar 14, 2023

2 votes

0 answers

13

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

392 views

admin asked Mar 14, 2023

18 votes

8 answers

14

ISRO2016-38
What is the highest type number that can be assigned to the following grammar? $S\to Aa,A\to Ba,B \to abc$ Type 0 Type 1 Type 2 Type 3

What is the highest type number that can be assigned to the following grammar?$$S\to Aa,A\to Ba,B \to abc$$Type 0Type 1Type 2Type 3

Anu

17.5k views

Anu asked Jul 4, 2016

0 votes

1 answer

15

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

270 views

Rajender gill asked Jan 11, 2023

1 votes

2 answers

16

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

727 views

ggwon asked Dec 29, 2022

0 votes

1 answer

17

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

514 views

Rajender gill asked Dec 21, 2022

0 votes

1 answer

18

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

284 views

Rajender gill asked Dec 21, 2022

0 votes

0 answers

19

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

506 views

Rajender gill asked Dec 21, 2022

1 votes

1 answer

20

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

418 views

Pranavpurkar asked Nov 13, 2022

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