Classical

Theory Of Computation MCQ - Regular languages and finite automata

31:  

 Can a DFA simulate NFA?

 
A.

NO

B.

YES

C.

SOMETIMES

D.

Depends on NFA

 
 

Option: B

Explanation :


32:  

Which of the following statements is wrong ?

 
A.

The language accepted by finite automata are the languages denoted by regular expressions

B.

For every DFA there is a regular expression denoting its language

C.

For a regular expression r, there does not exist NFA with L(r) any transit that accept

D.

None of these 

 
 

Option: C

Explanation :


33:  

Regular expression a / b denotes the set 

A.

 {a}

B.

{ ∈ , a, b }

C.

{a, b}

D.

{ ab }

 
 

Option: C

Explanation :


34:  

Regular expression (a | b ) (a | b) denotes the set

A.

{ a, b, ab, aa }

B.

{ a, b, ba, bb }

C.

{ a, b }

D.

{ aa, ab, ba, bb }

 
 

Option: D

Explanation :


35:  

 Which of the following regular expressions denotes zero or more instances of an a or b ? 

A.

a | b

B.

(ab)*

C.

 (a | b)*

D.

a* I b

 
 

Option: C

Explanation :




Suggest an improvement