Register

GO Classes Test Series 2023 | Theory of Computation | Test 2 | Question: 8

• retagged by
633 views
3 votes
3 votes

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}\}$ ?

• retagged by
User Avatar

1 Answer

3 votes
3 votes
The NFA recognizes the following language:

$\text{L}_{1}=\{w$ : the second last symbol of $w$ is not ${'} a \text{'} \}$
• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

402
views
1 answers
4 votes
GO Classes asked Jun 22, 2022
402 views
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
231
views
1 answers
3 votes
GO Classes asked Jun 22, 2022
231 views
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}$ ... $1$ is a subset of $2$, nor $2$ is a subset of $1.$
User Avatar
353
views
2 answers
3 votes
GO Classes asked Jun 22, 2022
353 views
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
Link Copied!