### Theory of Computations - MCQs

(1) The Context Free Languages (CFL) are closed for:

(i) Intersection (ii) Union (iii) Complementations (iv) Kleene Star

Then

(A) (i) and (iv)

(B) (i) and (iii)

(C) (ii) and (iv)

(D) (ii) and (iii)

(2) ________ Method is known as Subset Construction Method.

(A) NFA to DFA Conversion

(B) NFA - ^ to NFA

(C) DFA Minimization

(D) None of Above

(3) Regular Expression a + b denotes the set :

(A) { a }

(B) { ^ , a , b}

(C) { a , b}

(D) None of these

(4) A Language represented by a non-deterministic finite state automaton is:

(A) Context Free Language

(B) Context Sensitive Language

(C) Regular Language

(D) Natural Language

(i) Intersection (ii) Union (iii) Complementations (iv) Kleene Star

Then

(A) (i) and (iv)

(B) (i) and (iii)

(C) (ii) and (iv)

(D) (ii) and (iii)

(2) ________ Method is known as Subset Construction Method.

(A) NFA to DFA Conversion

(B) NFA - ^ to NFA

(C) DFA Minimization

(D) None of Above

(3) Regular Expression a + b denotes the set :

(A) { a }

(B) { ^ , a , b}

(C) { a , b}

(D) None of these

(4) A Language represented by a non-deterministic finite state automaton is:

(A) Context Free Language

(B) Context Sensitive Language

(C) Regular Language

(D) Natural Language

This comment has been removed by the author.

ReplyDeletein the intersection of two languages in finite automata, why it doesn't contain accepting state and why in union operation it contains accepting state ? please reply me .....

ReplyDelete