Register

Recent questions tagged regular-language

456
views
1 answers
2 votes
Test-Series
Consider the following language over $\sum$ = {0, 1}L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4}How many sates will min-DFA accepting L will have?
User Avatar
385
views
0 answers
0 votes
Cross product of dfa
The below question is from test series.In the below question I think option B will be correct and C will not be correct. (If the image is appearing too small ... final state of D1 and q2 is final state of D2. Is my justification correct?
User Avatar
337
views
1 answers
0 votes
Theory of Computation
b* a* ∩ a*b* = (a U b)* Is this statment wrong or correct ?
User Avatar
340
views
1 answers
0 votes
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
User Avatar
462
views
1 answers
0 votes
Pumping Lemma
If L = { x == y | where x and y are equal binary numbers} and Σ = {0, 1, =}How can I prove that L is not a regular language using pumping lemma and contradiction?
User Avatar
671
views
2 answers
0 votes
Identification of Regular Language | TOC | Practice Question | Unacademy Class
Which of the following is/are Regular?A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$ ... D] None R => ReversePlease describe your answer.
User Avatar
197
views
0 answers
0 votes
Best Open Video Playlist for Regular and Context-free Languages Topic | Theory of compuation
Please list out the best free available video playlist for Regular and Context-free Languages Topic from Theory of compuation as an answer here (only one playlist ... be selected as best.For the full list of selected videos please see here
User Avatar
388
views
1 answers
0 votes
Regular Expression
Identify whether the language is regular or not and plz justify the ans.
User Avatar
350
views
2 answers
3 votes
GO Classes Test Series 2023 | Theory of Computation | Test 2 | Question: 3
Consider the following languages :$L_{1}=\left\{a^{k} b^{m} c^{n} \mid(k=m\right.$ or $m=n)$ and $\left.k+m+n \geq 2\right\}$L_{2}=\left\{a^{k} b^{m ... are Regular?$\mathrm{L}_{2}$ Only$\mathrm{L}_{3}$ Only$L_{2}$ and $L_{3}$ onlyAll
User Avatar
400
views
1 answers
4 votes
GO Classes Test Series 2023 | Theory of Computation | Test 2 | Question: 10
Let $\text{L}$ be a language over an alphabet $\Sigma$. The equivalence relation $\sim_{\text{L}}$ on the set $\Sigma^{\ast}$ of finite strings ... classes is infinite.Which of the above statements is/are correct?Only $1$Only $2$BothNone
User Avatar
Page: