retagged by
503 views
4 votes
4 votes

Let $L$ be the language accepted by the following non-deterministic finite automaton with $\epsilon$-transitions:


The number of states in the minimal DFA that accepts the language that is recognized by the above NFA over alphabet $\{a\},$ is ________

retagged by

2 Answers

10 votes
10 votes

We can convert the given NFA into DFA and then minimize the resulting DFA. We’ll get the following minimized DFA.

edited by
1 votes
1 votes

Initial state: destination state @”a”

q0 : q1q4

q1q4 : q2q5

q2q5 : q3q4

q3q4 : q5

q5 : q4

q4 : q5


Hence, total 6 states in minimal DFA.

edited by
Answer:

Related questions

2 votes
2 votes
2 answers
2