Classical

Theory Of Computation MCQ - Regular languages and finite automata

41:  

 The regular sets are closed under

A.

union

B.

concatenation 

C.

Kleene's closure

D.

 all of these

 
 

Option: D

Explanation :


42:  

 Dynamic errors can be detected at

A.

compile time

 
B.

Run time

 
C.

both (a) and (b)

D.

none of these

 
 

Option: B

Explanation :


43:  

If a and b be the regular expressions, then ( a*  ∪ b* ) *  is equivalent to 

A.

(a ∪ b) *

B.

 (b* ∪  a*)* 

C.

 (b ∪ a)*

D.

(a ∪ b)

 
 

Option: A

Explanation :


44:  

 Finite state machines _________ recognize palindromes

A.

can

B.

can't

C.

may 

D.

may not

 
 

Option: B

Explanation :


45:  

 If S and T be language over Σ = {a, b } represented by regular expression (a + b * ) *  and (a + b) * , respectively, then

 
A.

S ⊂ T

B.

T⊂ S

C.

 S = T 

D.

S ∩  T= φ 

 
 

Option: C

Explanation :




Suggest an improvement