Recent questions tagged regular-language / GATE Overflow for GATE CSE

0 votes

0 answers

1

Ardens's theorem
I have a doubt in ardens theorem problem A=Ba+Ab B=Aa+Bb Assume B is final state Hence By ardens theorem A becomes A=Bab* . Hence B=Aa+Bb => Bab*a+Bb Therefore B=B(ab*a+b) is the final answer I get . But B is not in form of R=R+ST(ie. B=B(ab*a+b)) what to do? Here S=B,T=ab*a+b, Then what is R?

I have a doubt in ardens theorem problem A=Ba+AbB=Aa+BbAssume B is final state Hence By ardens theorem A becomes A=Bab* .Hence B=Aa+Bb = Bab*a+BbTherefore B=B(ab*a+b) is ...

Vignesh859

47 views

Vignesh859 asked May 8

0 votes

2 answers

2

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

179 views

programmer1218 asked Apr 11

0 votes

3 answers

3

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

234 views

RahulVerma3 asked Mar 27

0 votes

0 answers

4

#toc

Çșȇ ʛấẗẻ

103 views

Çșȇ ʛấẗẻ asked Feb 24

0 votes

0 answers

5

#TOC

Çșȇ ʛấẗẻ

67 views

Çșȇ ʛấẗẻ asked Feb 24

1 votes

1 answer

6

GATE CSE 2024 | Set 1 | Question: 13
Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular. Which of the following statements is/are always TRUE? $L_1=L_2$ if and only if $L_1 \cap \overline{L_2}=\phi$ $L_1 \cup L_3$ is not regular $\overline{L_3}$ is not regular $\overline{L_1} \cup \overline{L_2}$ is regular

Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular.Which of the following statements is/are always TRUE?$L_1=L_2$ if and only if $L_1 \c...

Arjun

3.0k views

Arjun asked Feb 16

4 votes

1 answer

7

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

650 views

GO Classes asked Jan 13

0 votes

1 answer

8

What is correct approach to solve such questions ?

ENTJ007

127 views

ENTJ007 asked Jan 12

2 votes

1 answer

9

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

215 views

Ramayya asked Jan 7

0 votes

1 answer

10

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

245 views

Deepak9000 asked Nov 27, 2023

0 votes

0 answers

11

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

154 views

Mrityudoot asked Nov 8, 2023

3 votes

2 answers

12

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

381 views

Jiten008 asked Oct 24, 2023

0 votes

1 answer

13

#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

349 views

Mrityudoot asked Oct 21, 2023

1 votes

1 answer

14

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

257 views

rexritz asked Oct 8, 2023

1 votes

1 answer

15

Self Doubt from GoClasses Test Series
If L= { a^p | where p is any prime number }, then what is:- i) L+ ii) L* iii)L^3

If L= { a^p | where p is any prime number }, then what is:- i) L+ ii) L*iii)L^3

Swarnava Bose

299 views

Swarnava Bose asked Aug 26, 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