Theory of Computation MCQ (Multiple Choice Questions) - SchoolingAxis

1. Which of the following do we use to form an NFA from a regular expression?

a. Subset Construction Method

b. Power Set Construction Method

c. Thompson Construction Method

d. Scott Construction Method

Ans- c. Thompson Construction Method

2. Which of the following is an application of Finite Automaton?

a. Compiler Design

b. Grammar Parsers

c. Text Search

d. All of the mentioned

Ans- d. All of the mentioned

3. It is less complex to prove the closure properties over regular languages using:

a. NFA

b. DFA

c. PDA

d. Can't be said

Ans- a. NFA

4. Under which of the following operation, NFA is not closed?

a. Negation

b. Kleene

c. Concatenation

d. None of the mentioned

Ans- d. None of the mentioned

5. Which of the following recognizes the same formal language as of DFA and NFA?

a. Power set Construction

b. Subset Construction

c. Robin-Scott Construction

d. All of the mentioned

Ans- d. All of the mentioned

6. Which of the following is a regular language?

a. String whose length is a sequence of prime numbers

b. String with substring wwr in between

c. Palindrome string

d. String with even number of Zero's

Ans- d. String with even number of Zero's

7. We can represent one language in more one FSMs, true or false?

a. TRUE

b. FALSE

c. May be true

d. Cannot be said

Ans- a. TRUE

8. In NFA, this very state is like dead-end non final state:

a. ACCEPT

b. REJECT

c. DISTINCT

d. START

Ans- b. REJECT

9. Subset Construction method refers to:

a. Conversion of NFA to DFA

b. DFA minimization

c. Eliminating Null references

d. ?-NFA to NFA

Ans- a. Conversion of NFA to DFA

10. What is the relation between DFA and NFA on the basis of computational power?

a. DFA > NFA

b. NFA > DFA

c. Equal

d. Can't be said

Ans- c. Equal