retagged by
538 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

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
Answer:

Related questions

4 votes
4 votes
1 answer
1