retagged by
1,466 views

2 Answers

Best answer
9 votes
9 votes

Yes, For every regular language, there exist a minimal DFA and its unique. Here the word, minimal plays the role, otherwise, there can be infinite DFA/NFA for accepting the same language. 

Suppose if you have a DFA ( $D_1$ )  for a language L then If you add some unreachable states into the $D_1$ then it becomes, something else, but It can not be minimal. Because in minimal, we remove all the unreachable and redundant steps from the DFA. 

I hope you get this. 

selected by
3 votes
3 votes
There can be more than 1 dfa possible for a regular language but there will be only 1 minimal dfa which is obtained by removing the dead states and merging the equal states and it will be unique.

Related questions