You are not logged in.

Pages:: **1**

## #1 2015-06-27 04:17:02

### Finite Automaton:

# Mathematics Quizzes Computation Theory

**Question:**

How many states are present in the smallest finite automaton which accepts the language {x I length of x is divisible by 3}?

**Option A):**

2**Option B):**

1**Option C):**

4**Option D):**

3

**Correct Answer is Option C):**

4

You cannot discover the new oceans unless you have the courage to lose the sight of the shore.

Offline

## 2015-06-27 04:17:02

**Advertisement****Ads By Google**

### Re: Finite Automaton:

\n

Pages:: **1**