Search results for regular-language / GATE Overflow for GATE CSE

117 votes

6 answers

1

GATE CSE 2014 Set 2 | Question: 36
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ ... is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular

Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has a...

go_editor

25.3k views

go_editor asked Sep 28, 2014

18 votes

7 answers

2

GATE CSE 2020 | Question: 51
Consider the following language. $L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$ The minimum number of states in DFA that accepts $L$ is _________

Consider the following language.$L = \{{ x\in \{a,b\}^*\mid}$number of $a$’s in $x$ divisible by $2$ but not divisible by $3\}$The minimum number of states in DFA that ...

Arjun

13.5k views

Arjun asked Feb 12, 2020

78 votes

4 answers

3

GATE CSE 2018 | Question: 52
Given a language $L$, define $L^i$ as follows:$L^0 = \{ \varepsilon \}$$L^i = L^{i-1} \bullet L \text{ for all } I >0$The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1 ($over alphabet $0)$ accepted by the following automaton. The order of $L_1$ is ________.

Given a language $L$, define $L^i$ as follows:$$L^0 = \{ \varepsilon \}$$$$L^i = L^{i-1} \bullet L \text{ for all } I >0$$The order of a language $L$ is defined as the s...

gatecse

20.7k views

gatecse asked Feb 14, 2018

34 votes

5 answers

4

GATE CSE 2019 | Question: 7
If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$

If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular?$L.L^R = \{xy \mid x \in L , y^R \in L\}$$\{ww^R \mid w \in L \...

Arjun

14.9k views

Arjun asked Feb 7, 2019

32 votes

1 answer

5

GATE CSE 2021 Set 2 | Question: 36
Consider the following two statements about regular languages: $S_1$: Every infinite regular language contains an undecidable language as a subset. $S_2$: Every finite language is regular. Which one of the following choices is correct? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ is true

Consider the following two statements about regular languages:$S_1$: Every infinite regular language contains an undecidable language as a subset.$S_2$:...

Arjun

12.0k views

Arjun asked Feb 18, 2021

0 votes

2 answers

6

Regular language
Can anyone explain how we can write this regular language for the following diagram ?(in depth)

Can anyone explain how we can write this regular language for the following diagram ?(in depth)

programmer1218

118 views

programmer1218 asked Apr 11

0 votes

3 answers

7

Made easy, theory of computaion, Easy level edition 2022
Please explain me why the 4th option is also a true statement.

Please explain me why the 4th option is also a true statement.

RahulVerma3

192 views

RahulVerma3 asked Mar 27

83 votes

8 answers

8

GATE CSE 2006 | Question: 29
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$'s in $s$ and $n_1(s)$ the number of $1$'s in $s$. Which one of the following languages is not regular? $L=\left \{ s\in (0+1)^* \mid n_{0}(s) \text{ is a 3-digit prime } \right \}$ ... $L=\left \{ s\in (0+1)^*\mid n_{0}(s) \mod 7=n_{1}(s) \mod 5=0 \right \}$

If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$’s in $s$ and $n_1(s)$ the number of $1$’s in $s$. Which one of the following languages i...

Rucha Shelke

19.7k views

Rucha Shelke asked Sep 18, 2014

4 votes

1 answer

9

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 63
This question concerns two languages over the alphabet $\Sigma=\{1,-1\}$ (note that this is an alphabet with just two symbols: $1$ and $-1 ).$ The two symbols are interpreted, in the natural way, as the numbers $1$ and $-1,$ in ... $\text{L}_1$ Only $\text{L}_2$ Both None

This question concerns two languages over the alphabet $\Sigma=\{1,-1\}$ (note that this is an alphabet with just two symbols: $1$ and $-1 ).$ The two symbols are interpr...

GO Classes

579 views

GO Classes asked Jan 13

0 votes

0 answers

10

#toc

Çșȇ ʛấẗẻ

91 views

Çșȇ ʛấẗẻ asked Feb 24

0 votes

0 answers

11

#TOC

Çșȇ ʛấẗẻ

57 views

Çșȇ ʛấẗẻ asked Feb 24

0 votes

1 answer

12

Not Regular language [find out]
Why is C is regular as it non regular as? Please help me with this confusion

Why is C is regular as it non regular as?Please help me with this confusion

Deepak9000

219 views

Deepak9000 asked Nov 27, 2023

2 votes

1 answer

13

ISRO 2024
Which f the following statements is FALSE? The intersection of a regular language and a context-free language is context=free The intersection of a regular language and context-free language is regular The union of two context-free languages is context-free The union of two regular languages is regular

Which f the following statements is FALSE?The intersection of a regular language and a context-free language is context=freeThe intersection of a regular language and con...

Ramayya

185 views

Ramayya asked Jan 7

0 votes

1 answer

14

What is correct approach to solve such questions ?

ENTJ007

100 views

ENTJ007 asked Jan 12

3 votes

2 answers

15

TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?

Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?

Jiten008

367 views

Jiten008 asked Oct 24, 2023

21 votes

5 answers

16

GATE CSE 2001 | Question: 2.6
Consider the following languages: $L1=\left\{ww \mid w \in \{a,b\}^*\right\}$ $L2=\left\{ww^R \mid w \in \{a,b\}^*, w^R \text{ is the reverse of w} \right\}$ $L3=\left\{0^{2i} \mid \text{ i is an integer} \right\}$ ... $L1$ and $L2$ Only $L2, L3$ and $L4$ Only $L3$ and $L4$ Only $L3$

Consider the following languages:$L1=\left\{ww \mid w \in \{a,b\}^*\right\}$$L2=\left\{ww^R \mid w \in \{a,b\}^*, w^R \text{ is the reverse of w} \right\}$$L3=\left\{0^{2...

Kathleen

8.1k views

Kathleen asked Sep 14, 2014

0 votes

0 answers

17

Pumping Lemma
If there is a w’ such that w’ ∉ L in the final step of pumping lemma, then L is not regular (Lemma fails) Can we conversely say for certain if L is not regular, then definitely there is a w’ ∉ L. Simply : Can there be a case where we have all w’ ∈ L and still language is not regular?

If there is a w’ such that w’ ∉ L in the final step of pumping lemma, then L is not regular (Lemma fails)Can we conversely say for certain if L is not regular, then...

Mrityudoot

142 views

Mrityudoot asked Nov 8, 2023

0 votes

1 answer

18

#Regular Languages
For a particular input, a turing machine can ‘hang’ on encountering an infinite loop. Why can’t we say the same for any other machine? i.e A DFA or NFA that follows say a*(b). Will the automaton not ‘hang’ if a string $a^n$ where $n \to$ ∞ is fed to it? Isn’t ‘never accepting but progressing’ the same as hanging?

For a particular input, a turing machine can ‘hang’ on encountering an infinite loop. Why can’t we say the same for any other machine? i.e A DFA or NFA that follows...

Mrityudoot

338 views

Mrityudoot asked Oct 21, 2023

1 votes

1 answer

19

Checking regularity of a given language.
$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$ Is this language regular?

$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$Is this language regular?

rexritz

253 views

rexritz asked Oct 8, 2023

0 votes

1 answer

20

Give a regular expression for L = {a^nb^m: n ≥ 1,m ≥ 1,nm ≥ 3}.

Rahhhhhul

1.5k views

Rahhhhhul asked Jun 12, 2023

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