Register

Recent questions tagged regular-language

57
views
1 answers
0 votes
Regular Expression
Is this language regular or not?xww^R | x,w E (a,b)*
User Avatar
94
views
0 answers
0 votes
Ardens's theorem
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 the ... B=B(ab*a+b)) what to do?Here S=B,T=ab*a+b, Then what is R? 
User Avatar
224
views
2 answers
0 votes
Regular language
Can anyone explain how we can write this regular language for the following diagram ?(in depth)
User Avatar
298
views
3 answers
0 votes
Made easy, theory of computaion, Easy level edition 2022
Please explain me why the 4th option is also a true statement.
User Avatar
3.5k
views
1 answers
2 votes
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 ... $\overline{L_1} \cup \overline{L_2}$ is regular
User Avatar
691
views
1 answers
4 votes
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 ... of the above languages is/are regular?Only $\text{L}_1$Only $\text{L}_2$BothNone
User Avatar
146
views
1 answers
0 votes
What is correct approach to solve such questions ?
User Avatar
271
views
2 answers
2 votes
ISRO 2024
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 ... -free languages is context-freeThe union of two regular languages is regular
User Avatar
261
views
1 answers
0 votes
Not Regular language [find out]
Why is C is regular as it non regular as?Please help me with this confusion
User Avatar
176
views
0 answers
0 votes
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 ... there be a case where we have all w' ∈ L and still language is not regular?
User Avatar
428
views
2 answers
3 votes
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
User Avatar
372
views
1 answers
0 votes
#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 ... ∞ is fed to it?Isn't never accepting but progressing' the same as hanging?
User Avatar
284
views
1 answers
1 votes
Checking regularity of a given language.
$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$Is this language regular?
User Avatar
324
views
1 answers
1 votes
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
User Avatar
Page: