You are not logged in.

Pages:: **1**

## #1 2016-10-20 07:27:42

### Theory Of Computation Quiz Question.

# Programming Languages Quizzes Theory Of Computation

**Question:**

What can be said about a regular language L over {a} whose minimal finite state automation has two states?

**Option A):**

L must be { a^{n} | n is even}**Option B):**

Either L must be {a^{n} | n is odd}, or L must be {a^{n} | n is even}**Option C):**

L must be {a^{n} | > 0}**Option D):**

L must be { a^{n} | n is odd}

**Correct Answer is Option A):**

L must be { a^{n} | n is even}

**Online Web Tutorials And Interview Questions With Answers Forum:**

https://globalguideline.com/forum/

Offline

## 2016-10-20 07:27:42

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

### Re: Theory Of Computation Quiz Question.

\n

Pages:: **1**