Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged goclasses2024-toc-2-weekly-quiz
3
votes
2
answers
1
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
+
–
3
votes
1
answer
2
GO Classes Test Series 2023 | Theory of Computation | Test 2 | Question: 8
Consider the following non-deterministic finite automaton(NFA), where $\Sigma = \{a, b, c\}.$ How many strings of length $6$ are accepted by the given NFA over the alphabet $\Sigma=\{\mathrm{a}, \mathrm{b}, \mathrm{c}\}$ ?
Consider the following non-deterministic finite automaton(NFA), where $\Sigma = \{a, b, c\}.$How many strings of length $6$ are accepted by the given NFA over the alphabe...
GO Classes
573
views
GO Classes
asked
Jun 22, 2022
Theory of Computation
goclasses2024-toc-2-weekly-quiz
numerical-answers
goclasses
theory-of-computation
finite-automata
2-marks
+
–
4
votes
1
answer
3
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
381
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
+
–
3
votes
1
answer
4
GO Classes Test Series 2023 | Theory of Computation | Test 2 | Question: 14
Consider the following languages: The language of regular expression $(0+1)^{\ast} 11(0+1)^{\ast}$ The language of regular expression $\left(0^{\ast} 1^{\ast} 11\right)^{\ast} 0^{\ast} 110^{\ast} 1^{\ast}$ Which of the following ... the proper subset of $1$ $1=2$ Neither $1$ is a subset of $2$, nor $2$ is a subset of $1.$
Consider the following languages:The language of regular expression $(0+1)^{\ast} 11(0+1)^{\ast}$The language of regular expression $\left(0^{\ast} 1^{\ast} 11\right)^{\a...
GO Classes
202
views
GO Classes
asked
Jun 22, 2022
Theory of Computation
goclasses2024-toc-2-weekly-quiz
goclasses
theory-of-computation
regular-expression
2-marks
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register