Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged regular-language
0
votes
1
answer
61
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
moe12leb
301
views
moe12leb
asked
Nov 2, 2022
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
1
answer
62
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?
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?
shallowfalcon
439
views
shallowfalcon
asked
Oct 17, 2022
Theory of Computation
theory-of-computation
pumping-lemma
regular-language
+
–
0
votes
2
answers
63
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 => Reverse Please describe your answer.
Which of the following is/are Regular?A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$B] $\left \{ WXW^{R}Y \space\ | \space\ W,X,Y...
anupamsworld
620
views
anupamsworld
asked
Aug 29, 2022
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
0
answers
64
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 per answer). We'll then select the best ... are more likely to be selected as best. For the full list of selected videos please see here
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 per an...
makhdoom ghaya
185
views
makhdoom ghaya
asked
Aug 18, 2022
Others
missing-videos
free-videos
video-links
go-classroom
regular-language
context-free-language
+
–
0
votes
1
answer
65
Regular Expression
Identify whether the language is regular or not and plz justify the ans.
Identify whether the language is regular or not and plz justify the ans.
Karishma Datt
364
views
Karishma Datt
asked
Jul 17, 2022
Theory of Computation
theory-of-computation
regular-language
test-series
+
–
3
votes
2
answers
66
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} c^{n} \mid(k=m\right.$ or $m=n)$ ... $\mathrm{L}_{2}$ Only $\mathrm{L}_{3}$ Only $L_{2}$ and $L_{3}$ only All
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} c^{n} \mid(k=m\righ...
GO Classes
335
views
GO Classes
asked
Jun 22, 2022
Theory of Computation
goclasses2024-toc-2-weekly-quiz
goclasses
theory-of-computation
regular-language
1-mark
+
–
4
votes
1
answer
67
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 over $\Sigma$ ... $1$ Only $2$ Both None
Let $\text{L}$ be a language over an alphabet $\Sigma$. The equivalence relation $\sim_{\text{L}}$ on the set $\Sigma^{\ast}$ of finite strings over $\Sigma$ is defined b...
GO Classes
379
views
GO Classes
asked
Jun 22, 2022
Theory of Computation
goclasses2024-toc-2-weekly-quiz
goclasses
theory-of-computation
regular-language
equivalence-class
2-marks
+
–
2
votes
1
answer
68
GO Classes Test Series 2023 | Theory of Computation | Test 1 | Question: 5
Consider the following statements : Any finite subset of $\{a, b\}^{\ast }$ is a regular language; For any regular expressions $\mathbf{r}$ and $\mathbf{s}$ ... $a$ Only $b$ Both None
Consider the following statements :Any finite subset of $\{a, b\}^{\ast }$ is a regular language;For any regular expressions $\mathbf{r}$ and $\mathbf{s}$, the regular ex...
GO Classes
267
views
GO Classes
asked
Jun 9, 2022
Theory of Computation
goclasses2024-toc-1-weekly-quiz
goclasses
theory-of-computation
regular-language
regular-expression
1-mark
+
–
Page:
« prev
1
2
3
4
5
6
7
8
...
24
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register