1. Regular expressions are closed under….

a Union
b b.intersection
c Kleen Closure
d all of the above

2. The total no. of states & transitions required to form a Moore machine that will produce
residue mode3
a 3&5
b b.2&5
c 3&6
d d.5&3

3. In Mealy machine the o/p depends upon

a Present State
b Present i/p
c Both (a) & (b)
d Present State

4. There are _____ tuples in 2DFA

a 8
b 6
c. 5
d. 7

5. Notation “*” represents ?

a. One ore more occurrence
b. zero or one occurrence
c. Zero or more occurrence
d. Zero and one occurrence

6. Which of the following is used to convert a DFA to regular Expression

a. Myhill Nerode
b. b.Pumping Lemma
c. Arden’s Theorem
d. None of the above

7. Myhill Nerode does the following

a. Minimization of DFA
b. Tells us when a lang. is regular
c. Both (a) & (b)
d. None of the above

8. Which of the strings cannot be generated using the expression

 (a+b)*ab*a
a. Aababbb
b. Bbbab
c. Ababaa
d. abbabbba

9. In Arden’s Theorem the equation R=Q+RP can be directly replaced by

a. Q=PR*
b. R=QP*
c. R=QP*P
d. P+R*Q

10. Which of the following properties are true for regular expression
(P+Q)*
a. (P*Q*)*
b. (P*+Q*)
c. (P*+Q*)*
d. Both (a) & (c)