# CS402 Theory of Automata 21 Nov Quiz 1 Fall 2012

1) The minimum length of the strings(except null string) of a language that starts and ends in the same letters will be

2) Decomposing a string into its valid units is referred as:

3) Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum ______________ number of states.

2

3

more than 3.

none of them

4) A string will be accepted by an NFA if there exist _______one successful path.

5) If R is a regular language and L is some language, and L U R is a _______, then L must be a ________.Regular language

6) Closure of an FA, is same as ___________ of an FA with itself, except
that the initial state of the required FA is a final state as well.
Select correct option:

Union
Sum
Intersection

7)If we have a finite language and the number of states in the FA is n then the maximum number of letters in the each word of the language that will be accepted by the given FA will be————————-

8) If R is a regular language and L is some language, and L U R is a regular language, then L must be a regular language.

Choices:

True

9) The minimum length of the strings(except null string) of a language that starts and ends in different letters will be:

10) If FA1 corresponds to (a+b)* then FA1 must accept ___________ string/strings

11) Decomposing a string into its valid units is referred as:

12) The minimum length of the strings(except null string) of a language that starts and ends in the same letters will be