You are not logged in.

Pages:: **1**

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

### Non-deterministic Finite Automaton:

# Mathematics Quizzes Computation Theory

**Question:**

W is any string whose length is n in {0, 1}* and L is the set of all sub-strings of W. The minimum number of states in a non-deterministic finite automaton that accepts L is:

**Option A):**

n + 1**Option B):**

2n**Option C):**

n**Option D):**

n - 1

**Correct Answer is Option A):**

n + 1

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

Offline

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

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

### Re: Non-deterministic Finite Automaton:

\n

Pages:: **1**