**Problem Detail:**

How can a finite automaton over(0,1) doesn't accept any string? I only can think of

`s->a->q->F `

Where the final state F is empty set. Is that true please?

###### Asked By : muguangde

#### Answered By : Tom Cornebize

A finite automaton does not accept any string if and only if all its final states are unreachable from the start state.

This is true if there is no final state, or if you cannot go from the start state to the final state.

###### Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/39812

**3.2K people like this**

## 0 comments:

## Post a Comment

Let us know your responses and feedback