You are on page 1of 1

1.

r1 = 1 (0 + 1)* r2 = 1 (1 + 0)+ r3 = 1 1* 0

Relation?

(a) L (r1) L (r2) and L(r1) L(r3) (b) L (r1) L (r2) and L(r2) L(r3) (c) L (r1) L (r2) and L(r2) L(r3)
(d) L (r1) L (r3) and L(r2) L(r1)

2. Give the strongest correct statement about finite language over finite ?

(a) It could be undecidable (b) It is Turing-recognizable (c) It is CSL (d) It is regular language

3. Let n1 be the number of states in minimal NFA of a partial language and n2 be the DFA.

Relation?

(a) n1 n2 (b) n1 n2 (c) n1 < n2 (d) n2 > n1